The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS 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

%I #11 Apr 13 2015 15:01:11

%S 3,198,270,522,570,600,822,882,1062,1950,2130,2268,2310,2592,2970,

%T 3168,5022,5502,6702,7350,9438,10038,10428,10500,14010,14562,15288,

%U 16650,17028,17958,18060,18522,19698,19890,20550,20718,20772,22158,22638,23058,23562,24108,25170,25602

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

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

%H Ray Chandler, <a href="/A256407/b256407.txt">Table of n, a(n) for n = 1..3258</a>

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

%K nonn

%O 1,1

%A _N. J. A. Sloane_, Apr 01 2015

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 13 03:50 EDT 2024. Contains 372497 sequences. (Running on oeis4.)