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 A065460 #10 Feb 17 2015 10:10:46
%S A065460 1,1,2,3,3,5,9,9,9,18,23,24,29,37,53,62,59,77,116,106,130,156,199,192,
%T A065460 221,257,342,336,384,402,577,501,599,639,835,774,910,912,1220,1113,
%U A065460 1378,1298,1703,1530,1907,1862,2398,2094,2471,2393,3356,2765,3543
%N A065460 Number of inequivalent (ordered) solutions to n^2 = sum of 6 squares of integers >= 0.
%H A065460 Alois P. Heinz, <a href="/A065460/b065460.txt">Table of n, a(n) for n = 0..600</a>
%e A065460 a(5)=5 because 25 produces {0,0,0,0,0,5}, {0,0,0,0,3,4}, {0,0,1,2,2,4}, {0,2,2,2,2,3}, {1,1,1,2,3,3}.
%t A065460 Length/@Table[SumOfSquaresRepresentations[6, (k)^2], {k, 72}]
%Y A065460 Cf. A063014, A016727.
%Y A065460 Column k=6 of A255212.
%K A065460 nonn
%O A065460 0,3
%A A065460 _Wouter Meeussen_, Nov 18 2001
%E A065460 a(0)=1 prepended by _Alois P. Heinz_, Feb 17 2015