OFFSET
1,2
COMMENTS
To look for terms it suffices to see if fifth powers have a divisors pair (k, m) such that phi(m) = k. - David A. Corneth, May 21 2024
LINKS
David A. Corneth, Table of n, a(n) for n = 1..8846 (first 38 terms from R. J. Mathar)
FORMULA
If n is in the sequence and prime p divides n, then p^5*n is in the sequence.
EXAMPLE
8 * phi(8) = 32 = 2^5.
PROG
(PARI) isok(n) = ispower(n*eulerphi(n), 5);
CROSSREFS
KEYWORD
nonn
AUTHOR
Seiichi Manyama, May 10 2024
STATUS
approved