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

 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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A000177 Number of partitions of n into 6 squares. 27
 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, 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, 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 (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 T. D. Noe, Table of n, a(n) for n = 0..10000 MATHEMATICA Table[PowersRepresentations[n, 6, 2] // Length, {n, 0, 100}] (* Jean-François Alcover, Feb 05 2016 *) CROSSREFS Sequence in context: A290491 A194314 A006371 * A319815 A222656 A162545 Adjacent sequences: A000174 A000175 A000176 * A000178 A000179 A000180 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.

Last modified December 5 06:35 EST 2022. Contains 358582 sequences. (Running on oeis4.)