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!)
A062743 Smallest prime prime(m) such that floor(prime(m)/m) = n. 5
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
a(n+1)/a(n) -> e as n -> infinity, as do the m's.
LINKS
Giovanni Resta, Table of n, a(n) for n = 1..50 (first 29 terms from Robert G. Wilson v)
FORMULA
A062742(n) = pi(a(n)).
MATHEMATICA
Do[ k = 1; While[ Floor[ Prime[m]/ m] != n, m++ ]; Print[Prime[k] ], {n, 1, 27} ]
CROSSREFS
Essentially the same as A038623.
Sequence in context: A303729 A296544 A136635 * A370825 A009084 A096057
KEYWORD
nonn
AUTHOR
Labos Elemer, Jul 12 2001
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
STATUS
approved

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 2 12:20 EDT 2024. Contains 372196 sequences. (Running on oeis4.)