This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A338548 #14 Nov 16 2022 06:55:44 %S A338548 1,-9,26,-56,124,-234,342,-448,702,-1116,1330,-1456,2196,-3078,3224, %T A338548 -3584,4912,-6318,6858,-6944,8892,-11970,12166,-11648,15500,-19764, %U A338548 18954,-19152,24388,-29016,29790,-28672,34580,-44208,42408,-39312,50652,-61722,57096,-55552,68920,-80028 %N A338548 a(n) = n^3 * Sum_{d|n} (-1)^(n/d + 1) * mu(d) / d^3. %H A338548 Amiram Eldar, <a href="/A338548/b338548.txt">Table of n, a(n) for n = 1..10000</a> %F A338548 G.f.: Sum_{k>=1} mu(k) * x^k * (1 - 4*x^k + x^(2*k)) / (1 + x^k)^4. %F A338548 G.f. A(x) satisfies: A(x) = x * (1 - 4*x + x^2) / (1 + x)^4 - Sum_{k>=2} A(x^k). %F A338548 Dirichlet g.f.: (1 - 2^(4 - s)) * zeta(s - 3) / zeta(s). %F A338548 a(n) = J_3(n) if n odd, J_3(n) - 16 * J_3(n/2) if n even, where J_3 = A059376 (Jordan function J_3). %F A338548 Multiplicative with a(2) = -9, a(2^e) = -7*2^(3*(e-1)) for e > 1, and a(p^e) = (p^3-1)*p^(3*(e-1)) for p > 2. - _Amiram Eldar_, Nov 15 2022 %t A338548 Table[n^3 Sum[(-1)^(n/d + 1) MoebiusMu[d]/d^3, {d, Divisors[n]}], {n, 1, 42}] %t A338548 nmax = 42; CoefficientList[Series[Sum[MoebiusMu[k] x^k (1 - 4 x^k + x^(2 k))/(1 + x^k)^4, {k, 1, nmax}], {x, 0, nmax}], x] // Rest %t A338548 f[p_, e_] := (p^3 - 1)*p^(3*(e - 1)); f[2, 1] = -9; f[2, e_] := -7*2^(3*(e - 1)); a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* _Amiram Eldar_, Nov 15 2022 *) %o A338548 (PARI) a(n) = n^3 * sumdiv(n, d, (-1)^(n/d+1)*moebius(d)/d^3); \\ _Michel Marcus_, Nov 02 2020 %Y A338548 Cf. A008683, A059376, A138503, A325596, A338547, A338549. %K A338548 sign,mult %O A338548 1,2 %A A338548 _Ilya Gutkovskiy_, Nov 02 2020