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