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.

A062743 Smallest prime prime(m) such that floor(prime(m)/m) = n.

Original entry on oeis.org

3, 2, 37, 127, 347, 1087, 3109, 8419, 24317, 64553, 175211, 480881, 1304707, 3523901, 9558533, 25874843, 70115473, 189961529, 514272533, 1394193607, 3779851091, 10246935679, 27788566133, 75370121191, 204475052401
Offset: 1

Views

Author

Labos Elemer, Jul 12 2001

Keywords

Comments

a(n+1)/a(n) -> e as n -> infinity, as do the m's.

Crossrefs

Essentially the same as A038623.

Programs

  • Mathematica
    Do[ k = 1; While[ Floor[ Prime[m]/ m] != n, m++ ]; Print[Prime[k] ], {n, 1, 27} ]

Formula

A062742(n) = pi(a(n)).

Extensions

More terms from Robert G. Wilson v, Jul 13 2001
a(27) from Farideh Firoozbakht, Sep 12 2005
Corrected by T. D. Noe, Nov 14 2006
a(30)-a(50) obtained from the values of A038625 computed by Jan Büthe. - Giovanni Resta, Sep 01 2018