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!)
A059407 a(n+1) = a(n)-th composite number, with a(1) = 11. 3

%I #14 Sep 12 2019 09:25:32

%S 11,20,32,48,68,93,124,162,209,266,334,415,513,628,764,922,1108,1325,

%T 1574,1858,2186,2562,2992,3480,4038,4670,5379,6184,7094,8115,9263,

%U 10552,11991,13600,15400,17403,19629,22107,24856,27902,31275,35008

%N a(n+1) = a(n)-th composite number, with a(1) = 11.

%H Chai Wah Wu, <a href="/A059407/b059407.txt">Table of n, a(n) for n = 1..900</a>

%t g[ n_Integer ] := (k = n + PrimePi[ n ] + 1; While[ k - PrimePi[ k ] - 1, k++ ]; k); NestList[ g, 11, 45 ]

%t Module[{c=Select[Range[500000],CompositeQ]},NestList[c[[#]]&,11,50]] (* Requires Mathematica version 10 or later *) (* _Harvey P. Dale_, Sep 12 2019 *)

%o (PARI) lista(nn) = {print1(a = 11, ", "); nb = 0; forcomposite(c=1, nn, nb++; if (nb==a, print1(c, ", "); a = c););} \\ _Michel Marcus_, May 14 2018

%Y Cf. A006508, A059408.

%K nonn

%O 1,1

%A _Robert G. Wilson v_, Jan 29 2001

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 April 23 13:51 EDT 2024. Contains 371914 sequences. (Running on oeis4.)