|
Search: id:A038607
|
|
|
| A038607 |
|
a(n) is the smallest prime number k such that k > n*pi(k), where pi(k) denotes the prime counting function. |
|
+0
3
|
|
| 2, 11, 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; listen)
|
|
|
OFFSET
|
1,1
|
|
|
FORMULA
|
a(n) = prime(A038606(n)) = A000040(A038606(n)).
|
|
EXAMPLE
|
For n=3, the 12th prime (37) is the first one satisfying p(k) > 3k.
|
|
MATHEMATICA
|
k = 1; Do[ While[ Prime[k] < n*k, k++ ]; Print[Prime[k]], {n, 1, 25} ]
|
|
CROSSREFS
|
Cf. A038606, A038623.
Sequence in context: A084098 A140561 A140553 this_sequence A079009 A097651 A059673
Adjacent sequences: A038604 A038605 A038606 this_sequence A038608 A038609 A038610
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
Vasiliy Danilov (danilovv(AT)usa.net) 1998 Jul
|
|
EXTENSIONS
|
Extended by Robert G. Wilson v (rgwv(AT)rgwv.com) and Ray Chandler (rayjchandler(AT)sbcglobal.net), Dec 01 2004
|
|
|
Search completed in 0.002 seconds
|
