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 A180466 #11 Mar 30 2012 17:22:56
%S A180466 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,3,1,1,2,1,2,1,
%T A180466 1,1,1,2,2,1,1,1,1,1,1,1,2,1,1,2,2,1,1,3,3,1,2,1,2,3,1,2,4,1,2,3,1,1,
%U A180466 2,1,2,1,1,1,2,1,2,1,3,1,1,1,2,1,2,3,4,1,1,1,1,3,1,2,3,1,1,1,3,1
%N A180466 The number of representations of n as a minimal number of squares, A002828(n).
%C A180466 By Lagrange's four square theorem, the minimal number of squares required to represent a number is 4 or less. See A141490 for the numbers k that have n minimal representations.
%H A180466 T. D. Noe, <a href="/A180466/b180466.txt">Table of n, a(n) for n = 1..1000</a>
%e A180466 27 has the following representations as the sum of 4 or fewer squares: 1+1+25, 9+9+9, and 1+1+9+16. The minimal number of squares is 3 and there are 2 such representations. Hence a(27)=2.
%t A180466 Table[r=PowersRepresentations[n,4,2]; Sort[Tally[4-Count[#,0]& /@ r]][[1,2]], {n,100}]
%K A180466 nonn
%O A180466 1,27
%A A180466 _T. D. Noe_, Jan 19 2011