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 A069546 #17 Oct 28 2022 07:14:52
%S A069546 1,10,17,53,37,170,65,236,174,370,145,901,197,650,629,987,325,1740,
%T A069546 401,1961,1105,1450,577,4012,968,1970,1618,3445,901,6290,1025,4026,
%U A069546 2465,3250,2405,9222,1445,4010,3349,8732,1765,11050,1937,7685,6438,5770
%N A069546 a(n) = Sum_{d|n} sigma(n*d).
%H A069546 Amiram Eldar, <a href="/A069546/b069546.txt">Table of n, a(n) for n = 1..10000</a>
%F A069546 Multiplicative with a(p^e) = (p^(e+1)*(p^(e+1)-1)-(p-1)*(e+1))/(p-1)^2.
%F A069546 Sum_{k=1..n} a(k) ~ c * n^3, where c = ((zeta(2)*zeta(3)^2)/3) * Product_{p prime} (1 + 1/p^2 - 1/p^4 - 1/p^5) = 1.09461730308... . - _Amiram Eldar_, Oct 28 2022
%t A069546 Table[ Apply[ Plus, DivisorSigma[1, n*Divisors[n]]], {n, 1, 50}]
%t A069546 f[p_, e_] := (p^(e + 1)*(p^(e + 1) - 1) - (p - 1)*(e + 1))/(p - 1)^2; a[1] = 1; a[n_] := Times @@ (f @@@ FactorInteger[n]); Array[a, 100] (* _Amiram Eldar_, Oct 28 2022 *)
%o A069546 (Magma) [&+[DivisorSigma(1,n*d):d in Divisors(n)]:n in [1..50]]; // _Marius A. Burtea_, Sep 15 2019
%o A069546 (PARI) a(n) = sumdiv(n, d, sigma(n*d)); \\ _Michel Marcus_, Sep 15 2019
%Y A069546 Cf. A061391, A062354.
%Y A069546 Cf. A002117, A013661.
%K A069546 mult,easy,nonn
%O A069546 1,2
%A A069546 _Vladeta Jovovic_, Apr 17 2002
%E A069546 Edited and extended by _Robert G. Wilson v_, Apr 22 2002