login
A372965
a(n) = Sum_{k = 1..n} ( n/gcd(k, n) )^4.
2
1, 17, 163, 529, 2501, 2771, 14407, 16913, 39529, 42517, 146411, 86227, 342733, 244919, 407663, 541201, 1336337, 671993, 2345779, 1323029, 2348341, 2488987, 6156503, 2756819, 7815001, 5826461, 9605467, 7621303, 19803869, 6930271, 27705631, 17318417, 23864993
OFFSET
1,2
LINKS
FORMULA
a(n) = Sum_{d|n} mu(n/d) * (n/d)^4 * sigma_5(d).
a(n) = Sum_{d|n} d^(5-m) * phi(d^m) for m > 0.
G.f.: Sum_{k>=1} k^(5-m) * phi(k^m) * x^k/(1 - x^k) for m > 0.
From Amiram Eldar, May 21 2024: (Start)
Multiplicative with a(p^e) = (p^(5*e+5) - p^(5*e+4) + p^4 - 1)/(p^5-1).
Dirichlet g.f.: zeta(s)*zeta(s-5)/zeta(s-4).
Sum_{k=1..n} a(k) ~ c * n^6 / 6, where c = zeta(6)/zeta(2) = 2*Pi^4/315 = 0.6184704192... (1/A157292). (End)
MATHEMATICA
f[p_, e_] := (p^(5*e+5) - p^(5*e+4) + p^4 - 1)/(p^5-1); a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, May 21 2024 *)
PROG
(PARI) a(n) = sumdiv(n, d, moebius(n/d)*(n/d)^4*sigma(d, 5));
(PARI) a(n) = sumdiv(n, d, eulerphi(d^5));
CROSSREFS
KEYWORD
nonn,mult
AUTHOR
Seiichi Manyama, May 18 2024
STATUS
approved