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.
The array begins: 1, 3, 4, 7, 6, 12, 8, 15, 13, 18, 12, 28, ... 1, 5, 7, 13, 11, 23, 15, 29, 25, 35, 23, 55, ... 1, 5, 10, 17, 16, 32, 22, 41, 37, 50, 34, 80, ... 1, 5, 10, 21, 21, 38, 29, 53, 46, 65, 45, 102, ... 1, 5, 10, 21, 26, 44, 36, 61, 55, 80, 56, 120, ... 1, 5, 10, 21, 26, 50, 43, 69, 64, 90, 67, 138, ... 1, 5, 10, 21, 26, 50, 50, 77, 73, 100, 78, 150, ... 1, 5, 10, 21, 26, 50, 50, 85, 82, 110, 89, 162, ... 1, 5, 10, 21, 26, 50, 50, 85, 91, 120, 100, 174, ... 1, 5, 10, 21, 26, 50, 50, 85, 91, 130, 111, 186, ... ...
# Produces the square array: with(numtheory): A:=proc(s,n) local d,s1,s2; s1:=0; s2:=0; for d in divisors(n) do if d <= s then s1:=s1+d^2 else s2:=s2+d; fi; od: s1+s*s2; end; for s from 1 to 12 do lprint([seq(A(s,n),n=1..12)]); od:
A[s_, n_] := DivisorSum[n, If[#<=s, #^2, 0]+If[#>s, s*#, 0]&];
Table[A[s-n+1, n], {s, 1, 12}, {n, 1, s}] // Flatten (* Jean-François Alcover, Mar 07 2023 *)