OFFSET
1,2
COMMENTS
De Koninck et al. showed that there are 85 terms in this sequence, yet a(6) = 3037500 was missing in their paper. With a(6), it was verified numerically that the first 38 terms (terms below 10^18) are correct.
There are no other missing terms and the sequence contains 86 terms overall. - Max Alekseyev, Sep 30 2025
LINKS
Max Alekseyev, Table of n, a(n) for n = 1..86
Jean-Marie De Koninck, Florian Luca and A. Sankaranarayanan, Positive integers whose Euler function is a power of their kernel function, Rocky Mountain Journal of Mathematics, Vol. 36, No. 1 (2006), pp. 81-96, alternative link.
EXAMPLE
32 is in the sequence since phi(32) = 16, rad(32) = 2 and 16 = 2^4.
MATHEMATICA
rad[n_] := Times @@ First /@ FactorInteger[n]; aQ[n_] := EulerPhi[n] == rad[n]^4; Select[Range[3*10^6], aQ]
PROG
(PARI) rad(n) = factorback(factorint(n)[, 1]); \\ A007947
isok(m) = eulerphi(m) == rad(m)^4; \\ Michel Marcus, Oct 15 2019
CROSSREFS
KEYWORD
nonn,fini,full
AUTHOR
Amiram Eldar, Oct 10 2019
EXTENSIONS
a(6) = 3037500 from Marius A. Burtea, Oct 11 2019
STATUS
approved
