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 A065462 #15 Feb 17 2015 10:49:50
%S A065462 1,1,2,3,5,8,11,18,25,36,51,73,90,133,169,223,295,380,452,603,763,903,
%T A065462 1115,1385,1668,2025,2398,2811,3535,4011,4683,5503,6724,7316,8684,
%U A065462 9946,11844,12994,15091,16712,20493,21663,24975,27536,33079,34654,39957,43315
%N A065462 Number of inequivalent (ordered) solutions to n^2 = sum of 8 squares of integers >= 0.
%H A065462 Alois P. Heinz, <a href="/A065462/b065462.txt">Table of n, a(n) for n = 0..500</a>
%e A065462 a(4)=5 because 16 produces {0,0,0,0,0,0,0,4}, {0,0,0,0,2,2,2,2}, {0,0,0,1,1,1,2,3}, {0,1,1,1,1,2,2,2}, {1,1,1,1,1,1,1,3}.
%t A065462 Length/@Table[SumOfSquaresRepresentations[8, (k)^2], {k, 36}]
%Y A065462 Cf. A016727, A063014.
%Y A065462 Column k=8 of A255212.
%K A065462 nonn
%O A065462 0,3
%A A065462 _Wouter Meeussen_, Nov 18 2001
%E A065462 a(0), a(37)-a(47) from _Alois P. Heinz_, Feb 16 2015