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.

A328516 a(n) = A039993(A179239(n)).

Original entry on oeis.org

0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 3, 1, 1, 1, 3, 0, 1, 1, 1, 3, 1, 2, 1, 2, 1, 2, 1, 1, 2, 3, 1, 4, 2, 1, 0, 0, 1, 0, 2, 0, 0, 1, 1, 1, 2, 1, 2, 0, 0, 2, 0, 0, 1, 1, 1, 3, 0, 0, 1, 0, 0, 0, 2, 1, 4, 2, 1, 2, 5, 0, 2, 1, 3, 7, 2, 3, 2, 4, 3, 4, 1, 5, 4, 4, 2, 6, 3, 3, 5, 6, 5, 7, 11
Offset: 0

Views

Author

David A. Corneth, Oct 18 2019

Keywords

Comments

A179239 lists the least number that has its permutation of digits.

Examples

			a(95) = 11 as A039993(A179239(95)) = A179239(137) and the embedded primes in the permutations of the digits are the eleven primes {3, 7, 13, 17, 31, 37, 71, 73, 137, 173, 317}.
		

Crossrefs

Formula

a(n) = A039993(A179239(n)).