The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A038098 Number of primes < n^3. 4

%I

%S 0,4,9,18,30,47,68,97,129,168,217,269,327,400,476,564,656,765,882,

%T 1007,1147,1298,1457,1633,1821,2020,2227,2460,2707,2961,3228,3512,

%U 3817,4137,4483,4821,5194,5579,5995,6413,6850,7308,7789,8293

%N Number of primes < n^3.

%C From _Zhi-Wei Sun_, Oct 17 2015: (Start)

%C Conjecture: (i) For any integer k > 2 the sequence pi(n^k)/n^k (n = 2,3,...) is strictly decreasing, where pi(x) denotes the number of primes not exceeding x.

%C (ii) All the numbers pi(n^2)/n^2 (n = 1,2,3,...) are pairwise distinct. Moreover, we have pi(n^2)/n^2 > pi((n+1)^2)/(n+1)^2 for all n > 15646.

%C (End)

%H R. J. Mathar, <a href="/A038098/b038098.txt">Table of n, a(n) for n = 1..500</a>

%F a(n) = A000720(A000578(n)). - _Michel Marcus_, Sep 02 2013

%e a(2)=4 because the only primes < 8 are 2,3,5 and 7.

%o (Sage) [prime_pi(n^3) for n in range(1, 45)] # _Zerinvary Lajos_, Jun 06 2009

%o (PARI) vector(100, n, primepi(n^3)) \\ _Altug Alkan_, Oct 17 2015

%Y Cf. A014085, A038107, A060199 (first differences).

%K nonn

%O 1,2

%A Joe K. Crump (joecr(AT)carolina.rr.com)

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

Last modified November 26 01:22 EST 2020. Contains 338631 sequences. (Running on oeis4.)