A096523 -id:A096523 - cp's OEIS frontend

A096835 Number of primes in the neighborhood of 3^n with radius ceiling(log(3^n)).

3, 2, 3, 2, 2, 2, 1, 3, 2, 2, 0, 0, 1, 3, 3, 0, 2, 2, 2, 3, 2, 4, 1, 3, 3, 2, 3, 2, 1, 2, 2, 1, 0, 1, 2, 5, 2, 3, 0, 2, 4, 1, 0, 3, 3, 2, 2, 1, 3, 3, 2, 1, 2, 3, 2, 2, 5, 0, 3, 2, 2, 3, 4, 0, 1, 3, 0, 1, 4, 0, 2, 1, 1, 2, 3, 2, 3, 1, 2, 3, 3, 0, 0, 1, 2, 2, 2, 2, 2, 2, 5, 3, 0, 1, 6, 1, 4, 5, 1, 2, 3, 2, 1, 1, 2

Offset: 1

Labos Elemer, Jul 14 2004

nonn

Cf. A096509-A096523, A096830-A096840.

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

A096836 Number of primes in the neighborhood of 10^n with radius ceiling(log(10^n)).

Original entry on oeis.org

3, 3, 1, 2, 3, 1, 1, 2, 3, 1, 3, 1, 1, 3, 1, 0, 7, 5, 1, 3, 0, 2, 2, 2, 1, 0, 0, 0, 2, 3, 3, 2, 4, 0, 2, 1, 3, 1, 5, 2, 0, 2, 4, 4, 2, 1, 3, 3, 3, 1, 0, 0, 0, 1, 2, 2, 1, 0, 1, 4, 4, 1, 2, 5, 2, 1, 4, 2, 3, 3, 2, 3, 3, 2, 1, 1, 2, 3, 1, 4, 4, 0, 4, 0, 2, 2, 0, 2, 3, 2, 6, 0, 3, 4, 4, 1, 1, 4, 0, 0, 4, 3, 3, 0, 3

Offset: 1

Labos Elemer, Jul 14 2004

nonn

			a(5)=3 and the 3 primes in [99988,100012] are {99989,99991,100003}.

Cf. A096509-A096523, A096830-A096840.

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

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

Original entry on oeis.org

0, 3, 3, 2, 2, 2, 3, 2, 2, 1, 0, 1, 3, 3, 1, 2, 1, 0, 6, 1, 2, 2, 3, 1, 1, 3, 3, 1, 0, 3, 2, 4, 2, 2, 4, 3, 2, 1, 5, 1, 1, 2, 3, 1, 3, 0, 2, 1, 3, 2, 1, 0, 4, 1, 2, 2, 2, 2, 1, 0, 1, 3, 2, 1, 0, 0, 2, 1, 3, 1, 1, 2, 1, 0, 2, 3, 5, 3, 3, 0, 3, 2, 2, 4, 4, 0, 6, 2, 1, 2, 1, 3, 3, 2, 1, 3, 2, 2, 1, 4, 1, 6, 0, 2, 1

Offset: 1

Labos Elemer, Jul 14 2004

nonn

			a(3)=3 and the 3 primes in [23,31] are {23,29,31}.

Cf. A096509-A096523, A096830-A096840.

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

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

Labos Elemer, Jul 14 2004

nonn

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

Cf. A096509-A096523, A096830-A096840.

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.

cp's OEIS Frontend

A096835 Number of primes in the neighborhood of 3^n with radius ceiling(log(3^n)).

Views

Author

Keywords

Crossrefs

Formula

A096836 Number of primes in the neighborhood of 10^n with radius ceiling(log(10^n)).

Views

Author

Keywords

Examples

Crossrefs

Formula

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

Views

Author

Keywords

Examples

Crossrefs

Formula

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

Views

Author

Keywords

Examples

Crossrefs

Formula