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 #36 Nov 06 2018 11:33:54
%S 1,1,1,1,2,2,1,1,2,2,2,2,2,3,2,1,3,3,3,3,4,3,3,2,2,4,4,4,4,5,3,3,4,3,
%T 5,5,5,6,5,3,5,5,5,6,5,6,5,4,4,6,7,6,8,8,7,5,6,5,8,8,4,9,7,6,7,7,8,9,
%U 9,7,9,6,7,8,10,9,9,11,7,8,8,8,11,11,9,12,11,7,9,9,12,13,9,10,11,8,6,10,13,13,13
%N Number of partitions of n into 5 squares.
%D E. Grosswald, Representations of Integers as Sums of Squares. Springer-Verlag, NY, 1985, p. 84.
%H T. D. Noe, <a href="/A000174/b000174.txt">Table of n, a(n) for n = 0..10000</a>
%H <a href="/index/Su#ssq">Index entries for sequences related to sums of squares</a>
%F a(n) = A002635(n) + A025428(n). - _Jinyuan Wang_, Oct 20 2018
%t Table[PowersRepresentations[n, 5, 2] // Length, {n, 0, 100}] (* _Jean-François Alcover_, Feb 04 2016 *)
%Y Equivalent sequences for other numbers of squares: A010052 (1), A000161 (2), A000164 (3), A002635 (4), A000177 (6), A025422 (7), A025423 (8), A025424 (9), A025425 (10).
%Y Cf. A295160 (largest number k with a(k) = n).
%K nonn
%O 0,5
%A _N. J. A. Sloane_