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 A241032 #11 Sep 08 2022 08:46:07 %S A241032 8,72,1300,31752,872644,25170552,741453700,22051219752,658764967684, %T A241032 19722455410392,591076720682500,17723450167663752,531571748759349124, %U A241032 15945186209351359032,478326193010497869700,14349345894391097803752 %N A241032 Sum of n-th powers of divisors of 30. %H A241032 Vincenzo Librandi, <a href="/A241032/b241032.txt">Table of n, a(n) for n = 0..200</a> %H A241032 <a href="/index/Rec#order_08">Index entries for linear recurrences with constant coefficients</a>, signature (72,-1942,25992,-190081,779760,-1747800,1944000,-810000). %F A241032 G.f.: (8 - 504*x + 11652*x^2 - 129960*x^3 + 760324*x^4 - 2339280* x^5 + 3495600*x^6 - 1944000*x^7) / ((1 - x)*(1 - 2*x)*(1 - 3*x)*(1 - 5*x)*(1 - 6*x)*(1 - 10*x)*(1 - 15*x)*(1 - 30*x)). %F A241032 a(n) = (1 + 2^n)*(1 + 3^n)*(1 + 5^n). %t A241032 Total[#^Range[0, 20] & /@ Divisors[30]] %o A241032 (Magma) [DivisorSigma(n, 30): n in [0..20]]; %Y A241032 Cf. A018255 (divisors of 30). %Y A241032 Cf. similar sequence listed in A241029. %K A241032 nonn,easy %O A241032 0,1 %A A241032 _Vincenzo Librandi_, Apr 17 2014