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
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 (list; graph; refs; listen; history; text; internal format)
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.

LINKS

Table of n, a(n) for n=2..68.

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

Cf. A007917, A000720, A000040.

Sequence in context: A070564 A072358 A074795 * A282426 A318781 A316844

Adjacent sequences:  A069574 A069575 A069576 * A069578 A069579 A069580

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, Apr 18 2002

STATUS

approved

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 22 06:54 EDT 2022. Contains 353933 sequences. (Running on oeis4.)