login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A069577
Smallest prime p such that pi(n) <= pi(p)*2, where pi(n) is the number of primes <= n, A000720.
0
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, 13, 13, 13, 13, 13, 13, 13, 13, 13, 17, 17, 17, 17, 17, 17, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 23, 23, 23, 23, 23, 23, 23, 23, 29, 29
OFFSET
2,1
COMMENTS
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.
EXAMPLE
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.
CROSSREFS
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Apr 18 2002
STATUS
approved