This site is supported by donations to The OEIS Foundation.

 Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS". Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A059396 Number of primes less than square root of n-th prime; i.e., number of trial divisions by smaller primes to show that n-th prime is indeed prime. 2
 0, 0, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 COMMENTS Perhaps close to 2*(n/log(n))^(1/2). LINKS Alois P. Heinz, Table of n, a(n) for n = 1..10000 FORMULA a(n) = A000720(A000196(A000040(n))). EXAMPLE a(32) = 5 since the 32nd prime is 131 which is not divisible by 2, 3, 5, 7 or 11 (and does not need to be tested against 13, 17, 19 etc. since 13^2 = 169 > 131). MAPLE a:= proc(n) option remember;       numtheory[pi](floor(sqrt(ithprime(n))))     end: seq(a(n), n=1..100);  # Alois P. Heinz, Sep 05 2011 MATHEMATICA Table[PrimePi[Sqrt[Prime[n]]], {n, 110}] (* Harvey P. Dale, Sep 06 2015 *) CROSSREFS Sequence in context: A178786 A000196 A111850 * A108602 A085290 A108611 Adjacent sequences:  A059393 A059394 A059395 * A059397 A059398 A059399 KEYWORD nonn,easy AUTHOR Henry Bottomley, Jan 29 2001 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.