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 A064951 #27 May 16 2024 08:40:34
%S A064951 1,7,28,72,177,303,604,948,1497,2127,3348,4272,6313,8119,10324,13060,
%T A064951 17701,20995,27512,32132,38453,45779,57440,64664,77689,89935,104704,
%U A064951 117948,141525,154755,183616,205472,231113,258959,290564,314720,364041
%N A064951 a(n) = Sum_{1 <= x, y <= n} lcm(x, y).
%C A064951 a(n) is also the entrywise 1-norm of the n X n LCM matrix.
%H A064951 Seiichi Manyama, <a href="/A064951/b064951.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..1000 from Harry J. Smith)
%F A064951 a(n) = a(n-1) + 2*A051193(n) - n = a(n-1) + n*A057660(n) = Sum_{1 <= i <= j <= n} (j^2/gcd(i, j)). - _Henry Bottomley_, Oct 29 2001
%F A064951 a(n) ~ 3 * zeta(3) * n^4 / (2*Pi^2). - _Vaclav Kotesovec_, May 29 2021
%t A064951 Table[nn = n;Total[Level[Table[Table[LCM[i, j], {i, 1, nn}], {j, 1, nn}], {2}]], {n, 1, 37}] (* _Geoffrey Critzer_, Jan 14 2015 *)
%o A064951 (PARI) { a=0; for (n=1, 1000, a+=n*sum(k=1, n, n/gcd(n, k)); write("b064951.txt", n, " ", a) ) } \\ _Harry J. Smith_, Oct 01 2009
%Y A064951 Cf. A018806, A051193, A057660.
%K A064951 nonn
%O A064951 1,2
%A A064951 _Vladeta Jovovic_, Oct 28 2001