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.

A045719 Number of primes embedded in n-th prime.

Original entry on oeis.org

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

Views

Author

Keywords

Comments

a(n) counts permuted subsequences of digits of prime(n) which denote primes distinct from prime(n).

Examples

			For example a(11)=3 because 37 generate 3 primes with its digits: 3, 7, 73
		

Crossrefs

Cf. A000040.

Extensions

More terms from David W. Wilson