login
A344140
a(n) = Sum_{x_1|n, x_2|n, ... , x_n|n} gcd(x_1,x_2, ... ,x_n).
8
1, 5, 10, 99, 36, 4290, 134, 72613, 20713, 1053700, 2058, 2194638822, 8204, 268550150, 1073938440, 156969213515, 131088, 101697785139535, 524306, 3657271905119820, 4398063288332, 17592232181770, 8388630, 4727105990672866963914, 847422827191, 4503600499785740
OFFSET
1,2
LINKS
FORMULA
a(n) = Sum_{x_1|n, x_2|n, ... , x_n|n} n/lcm(x_1,x_2, ... ,x_n).
a(n) = Sum_{d|n} phi(n/d) * tau(d)^n.
If p is prime, a(p) = 2^p - 1 + p.
a(n) = Sum_{k=1..n} tau(gcd(k,n))^n.
MATHEMATICA
a[n_] := DivisorSum[n, EulerPhi[n/#] * DivisorSigma[0, #]^n &]; Array[a, 20] (* Amiram Eldar, May 10 2021 *)
PROG
(PARI) a(n) = sumdiv(n, d, eulerphi(n/d)*numdiv(d)^n);
(PARI) a(n) = sum(k=1, n, numdiv(gcd(k, n))^n);
CROSSREFS
KEYWORD
nonn
AUTHOR
Seiichi Manyama, May 10 2021
STATUS
approved