login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A256407 Numbers n such that for some m, A166133(m)=n, A166133(m+1)=n^2-1, in increasing order. 4
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

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

LINKS

Ray Chandler, Table of n, a(n) for n = 1..3258

CROSSREFS

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

Sequence in context: A000724 A309749 A209120 * A256406 A157565 A157598

Adjacent sequences:  A256404 A256405 A256406 * A256408 A256409 A256410

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Apr 01 2015

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 12 11:25 EDT 2020. Contains 335658 sequences. (Running on oeis4.)