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.

A096839 Number of primes in the neighborhood of n^2 with radius ceiling(log(n^2)).

Original entry on oeis.org

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

Views

Author

Labos Elemer, Jul 14 2004

Keywords

Examples

			n=10: a[10]=3 and the 3 primes in interval [95, 105] around 10^2=100 are {97,101,103}.
		

Crossrefs

Programs

  • Mathematica
    f[n_] := (PrimePi[n^2 + Ceiling[Log[n^2]]] - PrimePi[n^2 - Ceiling[Log[n^2]] - 1]); Table[ f[n], {n, 105}] (* Robert G. Wilson v, Jul 14 2004 *)