OFFSET
1,2
COMMENTS
Inverse Möbius transform of A306671. - Antti Karttunen, May 19 2020
LINKS
Antti Karttunen, Table of n, a(n) for n = 1..65537
FORMULA
a(p) = 2 for p = odd primes (A065091).
EXAMPLE
a(6) = gcd(tau(1), pod(1)) + gcd(tau(2), pod(2)) + gcd(tau(3), pod(3)) + gcd(tau(6), pod(6)) = gcd(1, 1) + gcd(2, 2) + gcd(2, 3) + gcd(4, 36) = 1 + 2 + 1 + 4 = 8.
PROG
(Magma) [&+[GCD(#Divisors(d), &*Divisors(d)): d in Divisors(n)]: n in [1..100]]
(PARI) a(n) = sumdiv(n, d, gcd(numdiv(d), vecprod(divisors(d)))); \\ Michel Marcus, May 08 2020
CROSSREFS
KEYWORD
nonn
AUTHOR
Jaroslav Krizek, May 07 2020
STATUS
approved