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.

A096838 Number of primes in the neighborhood of prime(n), the n-th prime in the center with radius ceiling(log(prime(n))).

Original entry on oeis.org

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

Views

Author

Labos Elemer, Jul 14 2004

Keywords

Examples

			a(100)=2 and the two primes in [534,548] are {541,547};
		

Crossrefs

Formula

a(n) almost equals A096509(prime(n)) >= a(n) because here only primes are counted, the true prime powers not.
For all n, a(n) >= 1.