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 A064950 #23 Aug 28 2023 08:23:11
%S A064950 1,7,10,27,16,70,22,83,55,112,34,270,40,154,160,227,52,385,58,432,220,
%T A064950 238,70,830,141,280,244,594,88,1120,94,579,340,364,352,1485,112,406,
%U A064950 400,1328,124,1540,130,918,880,490,142,2270,267,987,520,1080,160,1708
%N A064950 a(n) = Sum_{i|n, j|n} lcm(i,j).
%H A064950 Harry J. Smith, <a href="/A064950/b064950.txt">Table of n, a(n) for n = 1..1000</a>
%F A064950 a(n) = Sum_{d|n} d*tau(d^2).
%F A064950 Multiplicative with a(p^e) = (p^(e+2) - 3*p^(e+1) + p + 1 + 2*p^(e+2)*e - 2*p^(e+1)*e)/(p-1)^2.
%t A064950 a[n_]:= Sum[LCM[i,j], {i, Divisors[n]}, {j, Divisors[n]}];
%t A064950 Array[a,60] (* _Jean-François Alcover_, Jun 03 2019 *)
%t A064950 f[p_, e_] := (p^(e+2) - 3*p^(e+1) + p + 1 + 2*p^(e+2)*e - 2*p^(e+1)*e)/(p-1)^2; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 60] (* _Amiram Eldar_, Aug 28 2023 *)
%o A064950 (PARI) for (n=1, 1000, d=divisors(n); a=sum(i=1, length(d), numdiv(d[i]^2)*d[i]); write("b064950.txt", n, " ", a)) \\ _Harry J. Smith_, Oct 01 2009
%o A064950 (Sage)
%o A064950 def A064950(n) :
%o A064950 tau = sloane.A000005; D = divisors(n)
%o A064950 return reduce(lambda x,y: x+y, [d*tau(d^2) for d in D])
%o A064950 [A064950(n) for n in (1..54)] # _Peter Luschny_, Sep 10 2012
%Y A064950 Cf. A060724, A000005, A062369, A062368, A062380.
%K A064950 mult,nonn,easy
%O A064950 1,2
%A A064950 _Vladeta Jovovic_, Oct 28 2001