Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #13 Aug 28 2016 18:18:32
%S 1,1,1,1,2,2,2,1,2,3,2,2,3,3,3,2,3,4,4,3,5,5,4,3,4,5,5,5,5,7,6,4,5,6,
%T 6,6,9,7,8,6,6,9,7,7,9,10,8,7,7,9,10,9,11,12,13,8,10,11,10,11,11,12,
%U 13,11,9,14,13,12,16,14,14,12,13,13,15,15,15,18,16,13,14,18,15,17,20,17,21,15,15
%N Number of partitions of n into 6 squares.
%D E. Grosswald, Representations of Integers as Sums of Squares. Springer-Verlag, NY, 1985, p. 84.
%H T. D. Noe, <a href="/A000177/b000177.txt">Table of n, a(n) for n = 0..10000</a>
%t Table[PowersRepresentations[n, 6, 2] // Length, {n, 0, 100}] (* _Jean-François Alcover_, Feb 05 2016 *)
%K nonn
%O 0,5
%A _N. J. A. Sloane_