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 A350673 #5 Jan 24 2022 16:12:20 %S A350673 0,0,0,0,1,0,0,1,1,0,0,1,2,1,0,0,0,2,2,0,0,0,1,0,3,0,1,0,0,1,1,0,0,1, %T A350673 1,0,0,1,2,1,4,1,2,1,0,0,0,2,2,4,4,2,2,0,0,0,0,0,3,4,5,4,3,0,0,0,0,1, %U A350673 0,0,4,5,5,4,0,0,1,0,0,1,1,0,4,5,6,5,4,0,1,1,0 %N A350673 Square array read by antidiagonals T(n, k), n, k >= 0; T(n, k) is the sum of the elements of the intersection of the multisets of positive squares summing to n and k, respectively, obtained by the greedy algorithm. %H A350673 Rémy Sigrist, <a href="/A350673/a350673.gp.txt">PARI program for A350673</a> %F A350673 T(n, k) = T(k, n). %F A350673 T(n, n) = n. %F A350673 T(n, 0) = T(0, k) = 0. %e A350673 Array T(n, k) begins: %e A350673 n\k| 0 1 2 3 4 5 6 7 8 9 10 %e A350673 ---+---------------------------------- %e A350673 0| 0 0 0 0 0 0 0 0 0 0 0 %e A350673 1| 0 1 1 1 0 1 1 1 0 0 1 %e A350673 2| 0 1 2 2 0 1 2 2 0 0 1 %e A350673 3| 0 1 2 3 0 1 2 3 0 0 1 %e A350673 4| 0 0 0 0 4 4 4 4 4 0 0 %e A350673 5| 0 1 1 1 4 5 5 5 4 0 1 %e A350673 6| 0 1 2 2 4 5 6 6 4 0 1 %e A350673 7| 0 1 2 3 4 5 6 7 4 0 1 %e A350673 8| 0 0 0 0 4 4 4 4 8 0 0 %e A350673 9| 0 0 0 0 0 0 0 0 0 9 9 %e A350673 10| 0 1 1 1 0 1 1 1 0 9 10 %o A350673 (PARI) See Links section. %Y A350673 Cf. A350674. %K A350673 nonn,tabl %O A350673 0,13 %A A350673 _Rémy Sigrist_, Jan 10 2022