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!)
A069577 Smallest prime p such that pi(n) <= pi(p)*2, where pi(n) is the number of primes <= n, A000720. 0

%I #5 Mar 30 2012 18:50:20

%S 2,2,2,3,3,3,3,3,3,5,5,5,5,5,5,7,7,7,7,7,7,11,11,11,11,11,11,11,11,13,

%T 13,13,13,13,13,13,13,13,13,17,17,17,17,17,17,19,19,19,19,19,19,19,19,

%U 19,19,19,19,23,23,23,23,23,23,23,23,29,29

%N Smallest prime p such that pi(n) <= pi(p)*2, where pi(n) is the number of primes <= n, A000720.

%C a(n) separates the primes <= n in two sets {q<=a(n)} and {q<a(n)<=n} which differ in size by not more than 1.

%e Primes <= 20: {2,3,5,7,11,13,17,19}, therefore pi(20)=8 and from 8<=pi(7)*2=4*2 follows a(20)=7.

%Y Cf. A007917, A000720, A000040.

%K nonn

%O 2,1

%A _Reinhard Zumkeller_, Apr 18 2002

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 April 24 00:30 EDT 2024. Contains 371917 sequences. (Running on oeis4.)