OFFSET
0,12
COMMENTS
An integer partition is knapsack if every distinct submultiset has a different sum.
I computed terms a(n) for n = 0..50000 and the subsequence a(128)-a(2647) of length 2520 is repeated continuously.
LINKS
Fausto A. C. Cariboni, Table of n, a(n) for n = 0..3000
EXAMPLE
The initial nonzero values count the following partitions:
9: (9)
10: (9,1)
11: (9,1,1), (9,2)
12: (9,1,1,1), (9,2,1), (9,3)
CROSSREFS
KEYWORD
nonn
AUTHOR
Fausto A. C. Cariboni, May 25 2021
STATUS
approved