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