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.

A195007 Number of primes in the range (n*sqrt(n-1), (n+1)*sqrt(n)].

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 2, 1, 1, 1, 1, 3, 2, 0, 1, 2, 1, 2, 1, 2, 1, 2, 2, 2, 1, 0, 3, 2, 1, 2, 1, 3, 2, 1, 1, 3, 0, 2, 2, 2, 1, 2, 2, 2, 1, 2, 2, 3, 1, 3, 1, 2, 2, 1, 2, 1, 1, 2, 3, 2, 2, 4, 1, 2, 2, 2, 3, 1, 2, 1, 2, 3, 2, 2, 1, 1
Offset: 1

Views

Author

Juri-Stepan Gerasimov, Sep 07 2011

Keywords

Examples

			a(1)=1`because 1*sqrt(1-1)<(prime 2)<=(1+1)*sqrt(1),
a(2)=1 because 2*sqrt(2-1)<(prime 3)<=(2+1)*sqrt(2).
		

Crossrefs

Programs

  • Mathematica
    Table[PrimePi[(n+1)*Sqrt[n]] - PrimePi[n*Sqrt[n-1]], {n, 100}] (* T. D. Noe, Sep 14 2011 *)