login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A062743 Smallest prime p(m) such that Floor[p(m)/m]=n. 4
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; internal format)
OFFSET

1,1

COMMENTS

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

LINKS

Robert G. Wilson v, Table of n, a(n) for n = 1..29

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.

Cf. A038607. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jan 30 2009]

Sequence in context: A054676 A154332 A136635 * A009084 A096057 A179984

Adjacent sequences:  A062740 A062741 A062742 * A062744 A062745 A062746

KEYWORD

easy,nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Jul 12 2001

EXTENSIONS

More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 13 2001

a(27) from Farideh Firoozbakht, Sep 12 2005

Corrected by T. D. Noe (noe(AT)sspectra.com), Nov 14 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 13:28 EST 2012. Contains 206031 sequences.