This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A059111 a(n) = floor(prime(n) - n*log(n)). 8
 2, 1, 1, 1, 2, 2, 3, 2, 3, 5, 4, 7, 7, 6, 6, 8, 10, 8, 11, 11, 9, 10, 10, 12, 16, 16, 14, 13, 11, 10, 20, 20, 21, 19, 24, 21, 23, 24, 24, 25, 26, 24, 29, 26, 25, 22, 30, 37, 36, 33, 32, 33, 30, 35, 36, 37, 38, 35, 36, 35, 32, 37, 45, 44, 41, 40, 49, 50, 54, 51, 50, 51, 53, 54, 55 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Harry J. Smith, Table of n, a(n) for n = 1..1000 C. K. Caldwell, How Many Primes Are There? MATHEMATICA Table[Floor[Prime[n]-n Log[n]], {n, 100}] (* Harvey P. Dale, May 02 2011 *) PROG (PARI) { default(realprecision, 100); for (n = 1, 1000, write("b059111.txt", n, " ", floor(prime(n) - n*log(n))); ) } \\ Harry J. Smith, Jun 25 2009 (MAGMA) [ Floor(NthPrime(n)-n*Log(n)): n in [1..75] ];  // Bruno Berselli, May 02 2011 CROSSREFS Cf. A064658, A064659, A059112. Sequence in context: A240837 A060502 A035439 * A103502 A127950 A069545 Adjacent sequences:  A059108 A059109 A059110 * A059112 A059113 A059114 KEYWORD nonn AUTHOR Henry Bottomley, Jan 04 2001 EXTENSIONS Definition corrected by Harry J. Smith, Jun 24 2009 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 August 24 18:12 EDT 2019. Contains 326295 sequences. (Running on oeis4.)