The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A059112 floor(prime(n) - n*log(n) - n*log(log(n)) + n). 4
 4, 4, 4, 5, 4, 5, 4, 5, 7, 6, 8, 8, 6, 6, 8, 10, 7, 9, 9, 6, 8, 7, 8, 12, 11, 8, 7, 5, 4, 13, 12, 13, 10, 15, 12, 12, 13, 12, 13, 13, 10, 15, 11, 10, 7, 13, 20, 18, 15, 13, 14, 10, 14, 15, 15, 15, 12, 12, 10, 7, 11, 19, 17, 13, 11, 20, 20, 24, 20, 18, 18, 20, 20, 20, 18, 18, 20, 18 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,1 LINKS Table of n, a(n) for n=2..79. C. K. Caldwell, How Many Primes Are There? EXAMPLE a(10000) = floor[104729 - 92103.403 - 22203.268 + 10000] = floor[422.328] = 422. MATHEMATICA Table[Floor[Prime[n]-n Log[n]-n Log[Log[n]]+n], {n, 2, 80}] (* Harvey P. Dale, Jul 10 2023 *) PROG (PARI) vector(100, n, floor(prime(n+1) - (n+1)*log(n+1) - (n+1)*log(log(n+1))+n+1)) \\ Derek Orr, Oct 27 2014 CROSSREFS Cf. A000040, A059111. Sequence in context: A309767 A199500 A164838 * A111731 A369339 A368868 Adjacent sequences: A059109 A059110 A059111 * A059113 A059114 A059115 KEYWORD nonn,easy AUTHOR Henry Bottomley, Jan 04 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 15 00:19 EDT 2024. Contains 375171 sequences. (Running on oeis4.)