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 A065461 #15 Sep 08 2020 19:55:00
%S A065461 1,1,2,3,4,7,10,13,16,27,36,43,58,72,99,130,146,178,254,265,342,417,
%T A065461 507,540,726,745,975,1092,1289,1338,1845,1751,2246,2447,2948,2852,
%U A065461 3932,3638,4728,4868,5778,5618,7659,6887,8891,8887,10825,10109,13712
%N A065461 Number of inequivalent (ordered) solutions to n^2 = sum of 7 squares of integers >= 0.
%H A065461 Alois P. Heinz, <a href="/A065461/b065461.txt">Table of n, a(n) for n = 0..500</a>
%e A065461 a(4)=4 because 16 produces {0,0,0,0,0,0,4}, {0,0,0,2,2,2,2}, {0,0,1,1,1,2,3}, {1,1,1,1,2,2,2}.
%t A065461 Table[Length[PowersRepresentations[n^2,7,2]],{n,0,50}] (* _Harvey P. Dale_, Sep 08 2020 *)
%Y A065461 Cf. A063014, A016727.
%Y A065461 Column k=7 of A255212.
%K A065461 nonn
%O A065461 0,3
%A A065461 _Wouter Meeussen_, Nov 18 2001
%E A065461 a(0)=1 prepended by _Alois P. Heinz_, Feb 17 2015
%E A065461 Previous Mathematica program replaced by _Harvey P. Dale_, Sep 08 2020