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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A053619 a(n) = round(n/(log(n)-1) - pi(n)). 1
 -1, -8, 28, 8, 5, 5, 3, 3, 4, 4, 3, 3, 2, 3, 3, 3, 2, 3, 2, 2, 2, 3, 2, 2, 2, 3, 3, 3, 2, 2, 2, 2, 2, 2, 3, 3, 2, 2, 3, 3, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 3, 2, 2, 2, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 3, 2, 2, 1, 1, 2, 2, 2, 2, 1, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 2, 2, 3, 3, 2, 2, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS G. C. Greubel, Table of n, a(n) for n = 1..10000 C. K. Caldwell, How Many Primes Are There? MATHEMATICA Table[Round[n/(Log[n] -1) -PrimePi[n]], {n, 1, 110}] (* G. C. Greubel, May 16 2019 *) PROG (PARI) {a(n) = round(n/(log(n)-1) - primepi(n))}; \\ G. C. Greubel, May 16 2019 (Magma) [Round(n/(Log(n)-1) - #PrimesUpTo(n)): n in [1..110]]; // G. C. Greubel, May 16 2019 (Sage) [round(n/(log(n)-1) - prime_pi(n)) for n in (1..110)] # G. C. Greubel, May 16 2019 CROSSREFS Cf. A000720, A052434, A052435. Sequence in context: A229114 A088029 A126815 * A272259 A112663 A220288 Adjacent sequences: A053616 A053617 A053618 * A053620 A053621 A053622 KEYWORD sign AUTHOR Henry Bottomley, Mar 21 2000 EXTENSIONS More terms from James A. Sellers, Mar 23 2000 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 February 24 04:32 EST 2024. Contains 370288 sequences. (Running on oeis4.)