login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A067600
Numbers n such that f(n) and f(f(n)) are prime, where f(k) = decimal encoding of the prime factorization of k.
1
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,1
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.
EXAMPLE
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.
MATHEMATICA
f[n_] := FromDigits[Flatten[IntegerDigits[FactorInteger[n]]]]; Select[ Range[4000], Union[ PrimeQ[ Drop[ NestList[f, #, 2], 1]]] == {True} & ]
CROSSREFS
Cf. A067599.
Sequence in context: A345689 A292072 A183377 * A348208 A160456 A289643
KEYWORD
base,easy,nonn
AUTHOR
Joseph L. Pe, Jan 31 2002
EXTENSIONS
Edited by Robert G. Wilson v and N. J. A. Sloane, Feb 02 2002
STATUS
approved