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 A362627 #7 Feb 16 2025 08:34:05
%S A362627 1,1,6,34,322,3588,52844,900082,18111465,411941506,10548286788,
%T A362627 298667744593,9286665651198,314077164671106,11484692279345752,
%U A362627 451291302965764596,18966834595501974235,848853415894558707472,40305029983754331855502,2023571200162099967806430,107109031661019664234558776
%N A362627 Euler transform of sigma_n(n) (sum of n-th powers of divisors of n).
%H A362627 N. J. A. Sloane, <a href="/transforms.txt">Transforms</a>
%H A362627 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/EulerTransform.html">Euler Transform</a>
%F A362627 G.f.: Product_{k>=1} 1/(1 - x^k)^sigma(k,k).
%F A362627 a(n) = (1/n)*Sum_{k=1..n} a(n-k)*b(k) for n>1, a(0)=1, where b(k) = Sum_{d|k} d*sigma(d,d).
%t A362627 a = Table[DivisorSigma[n, n], {n, 20}]; CoefficientList[Series[Product[1/(1 - x^m)^a[[m]], {m, 20}], {x, 0, 20}], x]
%Y A362627 Cf. A023887 (sigma_n(n)), A061256, A350503, A353233.
%K A362627 nonn,easy
%O A362627 0,3
%A A362627 _Wesley Ivan Hurt_, Apr 28 2023