login
A009213
a(n) = gcd(d(n), phi(n)), where d is the number of divisors of n (A000005) and phi is Euler's totient function (A000010).
3
1, 1, 2, 1, 2, 2, 2, 4, 3, 4, 2, 2, 2, 2, 4, 1, 2, 6, 2, 2, 4, 2, 2, 8, 1, 4, 2, 6, 2, 8, 2, 2, 4, 4, 4, 3, 2, 2, 4, 8, 2, 4, 2, 2, 6, 2, 2, 2, 3, 2, 4, 6, 2, 2, 4, 8, 4, 4, 2, 4, 2, 2, 6, 1, 4, 4, 2, 2, 4, 8, 2, 12, 2, 4, 2, 6, 4, 8, 2, 2, 1, 4, 2, 12, 4, 2, 4, 8, 2, 12, 4, 2, 4, 2, 4, 4, 2, 6, 6, 1, 2, 8, 2, 8, 8
OFFSET
1,3
LINKS
PROG
(PARI) A009213(n) = gcd(numdiv(n), eulerphi(n)); \\ Antti Karttunen, Sep 07 2018
CROSSREFS
KEYWORD
nonn
STATUS
approved