cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A256407 Numbers n such that for some m, A166133(m)=n, A166133(m+1)=n^2-1, in increasing order.

Original entry on oeis.org

3, 198, 270, 522, 570, 600, 822, 882, 1062, 1950, 2130, 2268, 2310, 2592, 2970, 3168, 5022, 5502, 6702, 7350, 9438, 10038, 10428, 10500, 14010, 14562, 15288, 16650, 17028, 17958, 18060, 18522, 19698, 19890, 20550, 20718, 20772, 22158, 22638, 23058, 23562, 24108, 25170, 25602
Offset: 1

Views

Author

N. J. A. Sloane, Apr 01 2015

Keywords

Comments

Subtracting 1 seems always to give a prime - see A256410.

Crossrefs

Cf. A166133, A256410. This is A256406 sorted into increasing order.