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.

A067600 Numbers n such that f(n) and f(f(n)) are prime, where f(k) = decimal encoding of the prime factorization of k.

Original entry on oeis.org

3, 20, 69, 171, 174, 267, 333, 360, 372, 448, 537, 665, 666, 776, 820, 824, 855, 873, 1016, 1125, 1330, 1413, 1450, 1532, 1604, 1689, 1796, 1860, 1899, 1959, 2048, 2068, 2184, 2319, 2449, 2620, 2658, 2670, 2804, 2823, 3139, 3210, 3342, 3464, 3552, 3589
Offset: 1

Views

Author

Joseph L. Pe, Jan 31 2002

Keywords

Comments

If n = p_1^e_1 * ... * p_r^e_r with p_1 < ... < p_r, then its decimal encoding is p_1 e_1...p_r e_r. For example, 15 = 3^1 * 5^1, so has decimal encoding 3151.

Examples

			The prime factorization of 20 = 2^2 * 5^1 with corresponding encoding 2251, which is a prime. 2251 = 2251^1 has encoding 22511, which is also prime. So 20 is a term of the sequence.
		

Crossrefs

Cf. A067599.

Programs

  • Mathematica
    f[n_] := FromDigits[Flatten[IntegerDigits[FactorInteger[n]]]]; Select[ Range[4000], Union[ PrimeQ[ Drop[ NestList[f, #, 2], 1]]] == {True} & ]

Extensions

Edited by Robert G. Wilson v and N. J. A. Sloane, Feb 02 2002