login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A373133
a(n) = Sum_{1 <= x_1, x_2, x_3 <= n} sigma( ( n/gcd(x_1, x_2, x_3, n) )^3 ).
5
1, 106, 1041, 7218, 19345, 110346, 136801, 465522, 768327, 2050570, 1947121, 7513938, 5226481, 14500906, 20138145, 29822066, 25640641, 81442662, 49651921, 139632210, 142409841, 206394826, 154751521, 484608402, 302749845, 554006986, 560366223, 987429618, 616040881
OFFSET
1,2
LINKS
FORMULA
a(n) = Sum_{d|n} J_3(d) * sigma(d^3), where the Jordan totient function J_3(n) = A059376(n).
From Amiram Eldar, May 26 2024: (Start)
Multiplicative with a(p^e) = (p^(6*e+4)*(p+1) - p^(3*e)*(p^4+p^3+p+1) + p^2+p)/((p^2-1)*(p^3+1)).
Sum_{k=1..n} a(k) ~ c * n^7 / 7, where c = zeta(4) * zeta(7) * Product_{p prime} (1 + 1/p^2 + 1/p^3 - 1/p^4 - 1/p^5 - 1/p^6 - 1/p^7 + 1/p^8) = 1.71945569563704656468... . (End)
MATHEMATICA
f[p_, e_] := (p^(6*e+4)*(p+1) - p^(3*e)*(p^4+p^3+p+1) + p^2+p)/((p^2-1)*(p^3+1)); a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, May 26 2024 *)
PROG
(PARI) J(n, k) = sumdiv(n, d, d^k*moebius(n/d));
a(n, k=3, m=3) = sumdiv(n, d, J(d, k)*sigma(d^m));
CROSSREFS
KEYWORD
nonn,mult
AUTHOR
Seiichi Manyama, May 26 2024
STATUS
approved