login
A295310
a(n) = gcd(n, A062401(n)), where A062401(n) = phi(sigma(n)).
4
1, 2, 1, 2, 1, 2, 1, 8, 3, 2, 1, 12, 1, 2, 1, 2, 1, 6, 1, 4, 1, 2, 1, 8, 5, 2, 1, 4, 1, 6, 1, 4, 1, 2, 1, 36, 1, 2, 3, 8, 1, 2, 1, 4, 3, 2, 1, 12, 1, 10, 3, 2, 1, 2, 1, 8, 1, 2, 1, 12, 1, 2, 3, 2, 1, 6, 1, 4, 1, 2, 1, 24, 1, 2, 15, 4, 1, 6, 1, 20, 1, 2, 1, 12, 1, 2, 1, 8, 1, 18, 1, 4, 1, 2, 1, 24, 1, 2, 3, 20, 1, 6, 1, 8, 1
OFFSET
1,2
LINKS
FORMULA
a(n) = gcd(n, A000010(A000203(n))).
MATHEMATICA
Array[GCD[#, EulerPhi[DivisorSigma[1, #]]] &, 105] (* Michael De Vlieger, Nov 23 2017 *)
PROG
(PARI) a(n) = gcd(n, eulerphi(sigma(n))); \\ Michel Marcus, Nov 23 2017
KEYWORD
nonn
AUTHOR
Antti Karttunen, Nov 22 2017
STATUS
approved