OFFSET
0,3
LINKS
Alois P. Heinz, Table of n, a(n) for n = 0..2500
Wikipedia, Partition (number theory)
EXAMPLE
a(0) = 1: the empty partition.
a(2) = 2: 2, 11.
a(3) = 3: 3, 21, 111.
a(4) = 4: 4, 31, 211, 1111.
a(5) = 5: 5, 41, 311, 2111, 11111.
a(6) = 8: 6, 33, 51, 222, 411, 3111, 21111, 111111.
a(7) = 11: 7, 43, 61, 322, 331, 511, 2221, 4111, 31111, 211111, 1111111.
MAPLE
b:= proc(n, i, p) option remember; `if`(n=0, 1,
`if`(i<1, 0, b(n, i-1, p)+add(`if`(i=p+j, 0,
b(n-i*j, min(n-i*j, i-1), p+j)), j=1..n/i)))
end:
a:= n-> b(n$2, 0):
seq(a(n), n=0..47);
CROSSREFS
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Jul 19 2024
STATUS
approved
