login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A000174 Number of partitions of n into 5 squares. 16
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, 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, 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 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,5
REFERENCES
E. Grosswald, Representations of Integers as Sums of Squares. Springer-Verlag, NY, 1985, p. 84.
LINKS
FORMULA
a(n) = A002635(n) + A025428(n). - Jinyuan Wang, Oct 20 2018
MATHEMATICA
Table[PowersRepresentations[n, 5, 2] // Length, {n, 0, 100}] (* Jean-François Alcover, Feb 04 2016 *)
CROSSREFS
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).
Cf. A295160 (largest number k with a(k) = n).
Sequence in context: A206483 A087011 A294602 * A156268 A053257 A331002
KEYWORD
nonn
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 19 06:25 EDT 2024. Contains 370953 sequences. (Running on oeis4.)