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

A319819
Number of partitions of n into exactly nine positive triangular numbers.
5
1, 0, 1, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 4, 3, 4, 3, 5, 5, 6, 5, 6, 6, 8, 8, 7, 9, 10, 11, 11, 11, 12, 13, 15, 14, 16, 17, 17, 19, 20, 19, 23, 23, 24, 25, 27, 27, 28, 33, 30, 33, 34, 34, 41, 39, 41, 41, 46, 44, 49, 50, 49, 54, 59, 56, 58, 63, 63, 68, 70, 67
OFFSET
9,10
LINKS
FORMULA
a(n) = [x^n y^9] 1/Product_{j>=1} (1-y*x^A000217(j)).
MAPLE
h:= proc(n) option remember; `if`(n<1, 0,
`if`(issqr(8*n+1), n, h(n-1)))
end:
b:= proc(n, i, k) option remember; `if`(n=0, `if`(k=0, 1, 0), `if`(
k>n or i*k<n, 0, b(n, h(i-1), k)+b(n-i, h(min(n-i, i)), k-1)))
end:
a:= n-> b(n, h(n), 9):
seq(a(n), n=9..120);
CROSSREFS
Column k=9 of A319797.
Cf. A000217.
Sequence in context: A319817 A233566 A319818 * A319820 A319799 A294078
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Sep 28 2018
STATUS
approved