login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A025436 Number of partitions of n into 3 distinct squares. 0
0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 2, 0, 0, 2, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 2, 1, 0, 0, 2, 1, 0, 0, 1, 2, 0, 1, 2, 1, 0, 1, 0, 1, 1, 0, 2, 2, 0, 0, 3, 1, 0, 1, 2, 1, 0, 0, 1, 3, 1, 0, 2, 1, 0, 1, 1, 1, 1, 1, 2, 2, 0, 0, 3, 3, 1, 0, 1, 2, 0, 0, 1, 2, 0, 1, 4, 0, 0, 2, 2, 2, 1 (list; graph; refs; listen; history; internal format)
OFFSET

0,27

CROSSREFS

Sequence in context: A028959 A079181 A093693 * A170976 A134109 A170978

Adjacent sequences:  A025433 A025434 A025435 * A025437 A025438 A025439

KEYWORD

nonn

AUTHOR

David W. Wilson (davidwwilson(AT)comcast.net)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 00:09 EST 2012. Contains 205978 sequences.