OFFSET
1,2
COMMENTS
Sequence is finite because for n large enough phi(n) > n / (exp(EulerGamma) * log(log(n))+3/log(log(n))), while pod(n) < 9*9^ceiling(log(n)/log(10)). If a(16) exists, it holds 10^13 < a(16) < 10^64. - Giovanni Resta, Apr 22 2014
REFERENCES
C. A. Pickover, "Wonders of Numbers, Adventures in Mathematics, Mind and Meaning," Oxford University Press, NY 2000, Chapter 72, 'Apocalyptic Numbers,' Pages 176 - 178.
LINKS
C. A. Pickover, "Wonders of Numbers, Adventures in Mathematics, Mind and Meaning," Zentralblatt review
EXAMPLE
Phi(666) = 6*6*6
MATHEMATICA
Select[ Range[ 10^7], EulerPhi[ # ] == Times @@ IntegerDigits[ # ] &]
CROSSREFS
KEYWORD
nonn,base,fini
AUTHOR
Robert G. Wilson v, Dec 26 2000
STATUS
approved