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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A059407 a(n+1) = a(n)-th composite number, with a(1) = 11. 3
 11, 20, 32, 48, 68, 93, 124, 162, 209, 266, 334, 415, 513, 628, 764, 922, 1108, 1325, 1574, 1858, 2186, 2562, 2992, 3480, 4038, 4670, 5379, 6184, 7094, 8115, 9263, 10552, 11991, 13600, 15400, 17403, 19629, 22107, 24856, 27902, 31275, 35008 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Chai Wah Wu, Table of n, a(n) for n = 1..900 MATHEMATICA g[ n_Integer ] := (k = n + PrimePi[ n ] + 1; While[ k - PrimePi[ k ] - 1, k++ ]; k); NestList[ g, 11, 45 ] Module[{c=Select[Range[500000], CompositeQ]}, NestList[c[[#]]&, 11, 50]] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Sep 12 2019 *) PROG (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 CROSSREFS Cf. A006508, A059408. Sequence in context: A302563 A011753 A120442 * A109376 A100038 A160843 Adjacent sequences:  A059404 A059405 A059406 * A059408 A059409 A059410 KEYWORD nonn AUTHOR Robert G. Wilson v, Jan 29 2001 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.

Last modified December 9 08:41 EST 2021. Contains 349627 sequences. (Running on oeis4.)