This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A111181 Prime(n) - Pi(n). 1
 2, 2, 3, 5, 8, 10, 13, 15, 19, 25, 26, 32, 35, 37, 41, 47, 52, 54, 59, 63, 65, 71, 74, 80, 88, 92, 94, 98, 99, 103, 116, 120, 126, 128, 138, 140, 145, 151, 155, 161, 166, 168, 177, 179, 183, 185, 196, 208, 212, 214, 218, 224, 225, 235, 241, 247, 253, 255, 260, 264 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Conjecture: There will always be an x such that a(x+1) - a(x) = k for k=1,2.. However, x becomes large when k > 70. LINKS Charles R Greathouse IV, Table of n, a(n) for n = 1..10000 FORMULA Prime(n) = the n-th prime. Pi(x) = number of primes <= x. MATHEMATICA Table[Prime[n]-PrimePi[n], {n, 60}] (* Harvey P. Dale, Mar 11 2012 *) PROG (PARI) primexmpix(n, k) = { local(x, y, z); for(x=1, n, y=prime(x)-primepi(x); z=prime(x+1)-primepi(x+1); if(z-y == k, print1(y", ") ) ) } (PARI) a(n)=prime(n)-primepi(n) \\ Charles R Greathouse IV, May 29 2013 CROSSREFS Sequence in context: A241421 A157176 A276429 * A267419 A076777 A240210 Adjacent sequences:  A111178 A111179 A111180 * A111182 A111183 A111184 KEYWORD easy,nonn AUTHOR Cino Hilliard, Oct 22 2005 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 13 22:48 EST 2019. Contains 329974 sequences. (Running on oeis4.)