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.

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

Original entry on oeis.org

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
Offset: 1

Views

Author

Robert G. Wilson v, Jan 29 2001

Keywords

Crossrefs

Programs

  • 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 *)
  • 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