login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A131872 Set m = 0, n = 1. Find smallest k >= 2 such that pi(k) = (k-pi(k)) - (m-pi(m)); set a(n) = pi(k), m = k, n = n+1. Repeat. 0

%I

%S 1,4,8,11,16,23,30,39,50,62,78,97,119,141,172,205,242,284,334,393,455,

%T 531,615,704,811,928,1059,1213,1373,1560,1761,1988,2239,2524,2833,

%U 3180,3557,3983,4448,4942,5503,6126,6791,7522,8331,9228,10188,11228

%N Set m = 0, n = 1. Find smallest k >= 2 such that pi(k) = (k-pi(k)) - (m-pi(m)); set a(n) = pi(k), m = k, n = n+1. Repeat.

%C For n>1, a(n)-a(n-1) is approximately pi(n)^2/n.

%H A. Granville and G. Martin, <a href="http://www.arXiv.org/abs/math.NT/0408319">Prime number races</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/PrimeCountingFunction.html">Prime Counting Function</a>

%e m=0, n=1; pi(2) = (2-1)-(0) = 1 = number of nonprimes from 1 to 2, a(1) = 1 is a term. Now n=2, m=2.

%e pi(9) = (9-4)-(2-1) = 4 = number of nonprimes from 3 to 9, a(2) = 4 is a term. Now n=3, m=9.

%e pi(21) = (21-8)-(9-4) = 8 = number of nonprimes from 10 to 21, a(3) = 8 is a term.

%t m=0; Do[If[PrimePi[n]==(n-PrimePi[n])-(m-PrimePi[m]), Print[PrimePi[n]]; m=n], {n, 1, 10^6, 1}]

%Y Cf. A000720, A062298.

%K nonn

%O 1,2

%A _Manuel Valdivia_, Oct 05 2007

%E Edited by _N. J. A. Sloane_, Nov 05 2007

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.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 7 03:42 EST 2016. Contains 278840 sequences.