login

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”).

A033985
Number of partitions of n into two or more distinct nonzero squares.
3
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, 2, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 2, 1, 0, 0, 2, 2, 0, 0, 1, 3, 1, 1, 2, 2, 1, 1, 1, 1, 1, 0, 2, 3, 1, 0, 4, 3, 0, 1, 2, 2, 1, 0, 1, 4, 3, 0, 2, 4, 2, 1, 2, 2, 1, 2, 3, 3, 2, 1, 3, 6, 3, 0, 2, 5, 3, 0, 1, 3, 3, 2
OFFSET
1,26
FORMULA
G.f.: Product_{k>=1} (1+x^(k^2)) - Sum_{k>=1} x^(k^2). - Sean A. Irvine, Jul 26 2020
CROSSREFS
KEYWORD
nonn
AUTHOR
EXTENSIONS
Title improved by Sean A. Irvine, Jul 26 2020
STATUS
approved