OFFSET
1,2
LINKS
Seiichi Manyama, Table of n, a(n) for n = 1..10000
FORMULA
a(n) = Sum_{x_1|n, x_2|n, x_3|n, x_4|n, x_5|n} n/lcm(x_1,x_2,x_3,x_4,x_5).
a(n) = Sum_{d|n} phi(n/d) * tau(d)^5.
If p is prime, a(p) = 31 + p.
a(n) = Sum_{k=1..n} tau(gcd(k,n))^5.
MATHEMATICA
a[n_] := DivisorSum[n, EulerPhi[n/#] * DivisorSigma[0, #]^5 &]; Array[a, 20] (* Amiram Eldar, May 10 2021 *)
PROG
(PARI) a(n) = sumdiv(n, i, sumdiv(n, j, sumdiv(n, k, sumdiv(n, l, sumdiv(n, m, gcd([i, j, k, l, m]))))));
(PARI) a(n) = sumdiv(n, i, sumdiv(n, j, sumdiv(n, k, sumdiv(n, l, sumdiv(n, m, n/lcm([i, j, k, l, m]))))));
(PARI) a(n) = sumdiv(n, d, eulerphi(n/d)*numdiv(d)^5);
(PARI) a(n) = sum(k=1, n, numdiv(gcd(k, n))^5);
CROSSREFS
KEYWORD
nonn,mult
AUTHOR
Seiichi Manyama, May 10 2021
STATUS
approved