OFFSET
1,2
COMMENTS
Sequence is finite since prime(d_1*d_2*...*d_k) <= prime(9^k) <= 9^k(k log 9 + log k + log log 9) < 10^(k-1) for large enough k, i.e., it will have fewer than k digits. In particular, a(n) < 10^69. - Chai Wah Wu, Aug 10 2017
LINKS
C. Rivera, Puzzle 279The Prime Puzzles & Problems connection.
EXAMPLE
35497 is in the sequence because 35497 = prime(3*5*4*9*7) - phi(3 + 5 + 4 + 9 + 7).
MATHEMATICA
Do[h=IntegerDigits[n]; l=Length[h]; If[ !MemberQ[h, 0]&&n==Prime[Product[h[[k]], {k, l}]]-EulerPhi[Sum[h[[k]], {k, l}]], Print[n]], {n, 6000000}]
CROSSREFS
KEYWORD
base,more,nonn,fini
AUTHOR
Farideh Firoozbakht, Oct 29 2004
STATUS
approved