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

A331984
Number of compositions (ordered partitions) of n into distinct square pyramidal numbers.
2
1, 1, 0, 0, 0, 1, 2, 0, 0, 0, 0, 0, 0, 0, 1, 2, 0, 0, 0, 2, 6, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 0, 0, 0, 2, 6, 0, 0, 0, 0, 0, 0, 0, 2, 6, 0, 0, 0, 6, 24, 0, 0, 0, 0, 1, 2, 0, 0, 0, 2, 6, 0, 0, 0, 0, 0, 0, 0, 2, 6, 0, 0, 0, 6, 24, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 6, 0, 0, 0, 6, 25
OFFSET
0,7
EXAMPLE
a(20) = 6 because we have [14, 5, 1], [14, 1, 5], [5, 14, 1], [5, 1, 14], [1, 14, 5] and [1, 5, 14].
CROSSREFS
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Feb 03 2020
STATUS
approved