A295315 a(n) = phi(sigma(n)) / gcd(sigma(n), phi(sigma(n))).
1, 2, 1, 6, 1, 1, 1, 8, 12, 1, 1, 3, 3, 1, 1, 30, 1, 8, 2, 2, 1, 1, 1, 4, 30, 2, 2, 3, 4, 1, 1, 4, 1, 1, 1, 72, 9, 4, 3, 4, 2, 1, 5, 2, 4, 1, 1, 15, 12, 20, 1, 3, 1, 4, 1, 4, 2, 4, 4, 2, 15, 1, 6, 126, 2, 1, 8, 2, 1, 1, 1, 32, 18, 6, 15, 12, 1, 2, 2, 10, 10, 2, 2, 3, 1, 10, 4, 4, 4, 4, 3, 2, 1, 1, 4, 2, 3, 12, 4
Offset: 1
Keywords
Links
- Antti Karttunen, Table of n, a(n) for n = 1..16384
Programs
-
PARI
a(n) = my(sn = sigma(n)); eulerphi(sn) / gcd(sn, eulerphi(sn)); \\ Michel Marcus, Nov 23 2017