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!)
A038607 a(n) is the smallest prime number k such that k > n*pi(k), where pi(k) denotes the prime counting function. 6

%I #24 Oct 04 2022 21:21:56

%S 2,11,37,127,347,1087,3109,8419,24317,64553,175211,480881,1304707,

%T 3523901,9558533,25874843,70115473,189961529,514272533,1394193607,

%U 3779851091,10246935679,27788566133,75370121191,204475052401,554805820711,1505578023841,4086199302113,11091501631019,30109570413007

%N a(n) is the smallest prime number k such that k > n*pi(k), where pi(k) denotes the prime counting function.

%C a(n) is about exp(n+1+1/(n+1)). - _Charles R Greathouse IV_, Sep 05 2011

%H Giovanni Resta, <a href="/A038607/b038607.txt">Table of n, a(n) for n = 1..50</a>

%F a(n) = prime(A038606(n)) = A000040(A038606(n)).

%e For n=1, a(1) = 2, since 2 > 1*pi(2) = 1*1. - _N. J. A. Sloane_, Dec 09 2020

%e For n=3, the 12th prime (37) is the first one satisfying p(k) > 3k.

%t k = 1; Do[ While[ Prime[k] < n*k, k++ ]; Print[Prime[k]], {n, 1, 25} ]

%o (PARI) k=1;n=1;forprime(p=3,4e9,if(p/n++>k,print1(p", ");k++)) \\ _Charles R Greathouse IV_, Sep 06 2011

%Y Cf. A038606, A038623.

%K nonn,nice

%O 1,1

%A Vasiliy Danilov (danilovv(AT)usa.net), Jul 1998

%E Extended by _Robert G. Wilson v_ and _Ray Chandler_, Dec 01 2004

%E a(26)-a(30) from _Charles R Greathouse IV_, Sep 05 2011, Sep 06 2011

%E a(31)-a(50) obtained from the values of A038625 computed by _Jan Büthe_. - _Giovanni Resta_, Sep 01 2018

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 10 12:47 EDT 2024. Contains 372387 sequences. (Running on oeis4.)