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 A077457 #17 Oct 28 2022 07:14:33
%S A077457 1,205,5905,52429,375601,1210525,5649505,13421773,38742049,76998205,
%T A077457 212601841,309593245,810932305,1158148525,2217923905,3435973837,
%U A077457 6951703105,7942120045,16936647121,19692384829,33360327025,43583377405,78163228705,79255569565,146719125601
%N A077457 a(n) = sigma_4(n^4)/sigma_2(n^4).
%C A077457 sigma_y(n^x) divides sigma_x(n^x) for all n if y divides x.
%H A077457 Amiram Eldar, <a href="/A077457/b077457.txt">Table of n, a(n) for n = 1..10000</a>
%F A077457 a(n) = A001159(n^4)/A001157(n^4).
%F A077457 Multiplicative with a(p^e) = (p^(8*e+2) + 1)/(p^2 + 1). - _Amiram Eldar_, Sep 09 2020
%F A077457 Sum_{k=1..n} a(k) ~ c * n^9, where c = (zeta(9)/9) * Product_{p prime} (1 - 1/p^3 + 1/p^5 - 1/p^7) = 0.09549806119... . - _Amiram Eldar_, Oct 28 2022
%t A077457 f[p_, e_] := (p^(8*e+2) + 1)/(p^2 + 1); a[n_] := Times @@ (f @@@ FactorInteger[n]); Array[a, 25] (* _Amiram Eldar_, Sep 09 2020 *)
%o A077457 (PARI) a(n)=sumdiv(n^4,d,d^4)/sumdiv(n^4,d,d^2)
%o A077457 (PARI) a(n) = my(f=factor(n^4)); sigma(f, 4)/sigma(f, 2); \\ _Michel Marcus_, Sep 09 2020
%Y A077457 Cf. A001157, A001159, A013667, A057660, A077454, A077455, A077456.
%K A077457 nonn,easy,mult
%O A077457 1,2
%A A077457 _Benoit Cloitre_, Nov 30 2002