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 A373000 #14 May 20 2024 02:28:51
%S A373000 1,32,243,1054,3125,7776,16807,33818,59289,100000,161051,256122,
%T A373000 371293,537824,759375,1082386,1419857,1897248,2476099,3293750,4084101,
%U A373000 5153632,6436343,8217774,9768745,11881376,14408187,17714578,20511149,24300000,28629151,34636802,39135393
%N A373000 a(n) = Sum_{k=1..n} sigma( (n/gcd(k,n))^4 ).
%H A373000 Amiram Eldar, <a href="/A373000/b373000.txt">Table of n, a(n) for n = 1..10000</a>
%F A373000 If k is squarefree (cf. A005117) then a(k) = k^5.
%F A373000 a(n) = Sum_{d|n} phi(d) * sigma(d^4).
%F A373000 From _Amiram Eldar_, May 20 2024: (Start)
%F A373000 Multiplicative with a(p^e) = (p^(5*e+5)-1)/(p^5-1) - (p^e-1)/(p-1).
%F A373000 Sum_{k=1..n} a(k) ~ c * n^6 / 6, where c = (zeta(5) * zeta(6) / zeta(2)) * Product_{p prime} (1 + 1/p^2 + 1/p^4 - 1/p^5) = 1.00815225456201682259... . (End)
%t A373000 a[n_] := DivisorSum[n, EulerPhi[#] * DivisorSigma[1, #^4] &]; Array[a, 100] (* _Amiram Eldar_, May 20 2024 *)
%o A373000 (PARI) a(n) = sumdiv(n, d, eulerphi(d)*sigma(d^4));
%Y A373000 Cf. A005117.
%Y A373000 Cf. A013663, A013664.
%K A373000 nonn,mult
%O A373000 1,2
%A A373000 _Seiichi Manyama_, May 19 2024