cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A289500 Number of primes in the interval [9n, 10n].

Original entry on oeis.org

0, 1, 1, 1, 1, 1, 1, 2, 2, 1, 4, 2, 1, 4, 3, 3, 3, 4, 3, 5, 4, 2, 4, 5, 5, 4, 4, 5, 6, 5, 4, 5, 4, 6, 5, 6, 6, 7, 7, 6, 7, 7, 6, 8, 8, 8, 9, 9, 8, 8, 9, 6, 8, 7, 7, 6, 7, 8, 8, 10, 10, 12, 11, 10, 12, 12, 11, 12, 10, 11, 12, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11
Offset: 1

Views

Author

FUNG Cheok Yin, Jul 12 2017

Keywords

Crossrefs

Programs

  • Magma
    [0] cat [#PrimesInInterval(9*n, 10*n): n in [2..100]]; // Vincenzo Librandi, Jul 13 2017
  • Maple
    seq(numtheory:-pi(10*n)-numtheory:-pi(9*n),n=1..100); # Robert Israel, Jul 12 2017
  • Mathematica
    Join[{0}, Table[PrimePi[10 n] - PrimePi[9 n], {n, 2, 100}]] (* Vincenzo Librandi, Jul 13 2017 *)
  • PARI
    a(n) = primepi(10*n) - primepi(9*n); \\ Michel Marcus, Jul 12 2017
    

Formula

a(n) = n/log(n) + (1 + log(3^18/10^10))*n/log(n)^2 + O(n/log(n)^3) as n -> infinity. - Robert Israel, Jul 12 2017