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 A321295 #21 Jun 27 2025 23:02:09
%S A321295 1,10,84,1092,15630,284700,5764808,134744072,3486961557,100097666500,
%T A321295 3138428376732,107019534520152,3937376385699302,155577590681061500,
%U A321295 6568408813691796120,295152408847700721680,14063084452067724991026,708238048886859220660710
%N A321295 a(n) = n * sigma_n(n).
%H A321295 Seiichi Manyama, <a href="/A321295/b321295.txt">Table of n, a(n) for n = 1..385</a>
%F A321295 G.f.: Sum_{k>=1} k^(k+1)*x^k/(1 - (k*x)^k)^2.
%F A321295 a(n) = Sum_{d|n} phi(n/d)*sigma_(n+1)(d).
%F A321295 a(n) = n * A023887(n).
%t A321295 Table[n DivisorSigma[n, n], {n, 18}]
%t A321295 nmax = 18; Rest[CoefficientList[Series[Sum[k^(k + 1) x^k/(1 - (k x)^k)^2, {k, 1, nmax}], {x, 0, nmax}], x]]
%t A321295 Table[Sum[EulerPhi[n/d] DivisorSigma[n + 1, d], {d, Divisors[n]}], {n, 18}]
%o A321295 (PARI) a(n) = n*sigma(n, n); \\ _Michel Marcus_, Nov 03 2018
%o A321295 (Perl) use ntheory ":all"; say "$_ ",vecprod($_,divisor_sum($_,$_)) for 1..30; # _Dana Jacobsen_, Nov 05 2018
%o A321295 (Magma) [n*DivisorSigma(n, n): n in [1..20]]; // _Vincenzo Librandi_, Nov 06 2018
%Y A321295 Cf. A023887, A064987.
%K A321295 nonn
%O A321295 1,2
%A A321295 _Ilya Gutkovskiy_, Nov 02 2018