OFFSET
1,6
COMMENTS
See A324527(n) = the smallest numbers k such that a(k) = n.
LINKS
Antti Karttunen, Table of n, a(n) for n = 1..16384
Antti Karttunen, Data supplement: n, a(n) computed for n = 1..65537
EXAMPLE
For n=6: a(6) = gcd(tau(6), pod(6)) = gcd(4, 36) = 4.
PROG
(Magma) [GCD(SumOfDivisors(n), &*[d: d in Divisors(n)]): n in [1.. 100]]
(PARI) a(n) = my(d=divisors(n)); gcd(vecsum(d), vecprod(d)); \\ Michel Marcus, Mar 05 2019
CROSSREFS
KEYWORD
nonn
AUTHOR
Jaroslav Krizek, Mar 05 2019
STATUS
approved