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 A321140 #26 Oct 25 2020 03:04:06
%S A321140 1,10,29,83,127,290,345,668,786,1270,1333,2407,2199,3450,3683,5349,
%T A321140 4915,7860,6861,10541,10005,13330,12169,19372,15878,21990,21226,28635,
%U A321140 24391,36830,29793,42798,38657,49150,43815,65238,50655,68610,63771,84836,68923,100050,79509,110639,99822
%N A321140 a(n) = Sum_{d|n} sigma_3(d).
%C A321140 Inverse Möbius transform applied twice to cubes.
%H A321140 Seiichi Manyama, <a href="/A321140/b321140.txt">Table of n, a(n) for n = 1..10000</a>
%H A321140 N. J. A. Sloane, <a href="/transforms.txt">Transforms</a>
%F A321140 G.f.: Sum_{k>=1} sigma_3(k)*x^k/(1 - x^k).
%F A321140 a(n) = Sum_{d|n} d^3*tau(n/d).
%F A321140 From _Jianing Song_, Oct 28 2018: (Start)
%F A321140 Multiplicative with a(p^e) = (p^3*(p^(3e+3) - e - 2) + e + 1)/(p^3 - 1)^2.
%F A321140 Dirichlet g.f.: zeta(s)^2*zeta(s-3). (End)
%F A321140 Sum_{k=1..n} a(k) ~ Pi^8 * n^4 / 32400. - _Vaclav Kotesovec_, Nov 08 2018
%p A321140 with(numtheory): seq(coeff(series(add(sigma[3](k)*x^k/(1-x^k),k=1..n),x,n+1), x, n), n = 1 .. 45); # _Muniru A Asiru_, Oct 28 2018
%t A321140 Table[Sum[DivisorSigma[3, d], {d, Divisors[n]}] , {n, 45}]
%t A321140 nmax = 45; Rest[CoefficientList[Series[Sum[DivisorSigma[3, k] x^k/(1 - x^k), {k, 1, nmax}], {x, 0, nmax}], x]]
%t A321140 f[p_, e_] := (p^3*(p^(3e+3) - e - 2) + e + 1)/(p^3 - 1)^2; a[1] = 1; a[n_] := Times @@ (f @@@ FactorInteger[n]); Array[a, 100] (* _Amiram Eldar_, Oct 25 2020 *)
%o A321140 (PARI) a(n) = sumdiv(n, d, sigma(d, 3)); \\ _Michel Marcus_, Oct 28 2018
%Y A321140 Cf. A001158, A007429, A007433, A027848.
%K A321140 nonn,mult,easy
%O A321140 1,2
%A A321140 _Ilya Gutkovskiy_, Oct 28 2018