OFFSET
0,7
COMMENTS
An integer partition is knapsack if every distinct submultiset has a different sum.
I computed terms a(n) for n = 0..10000 and (3, 4, 2, 3, 4, 4, 1, 4, 4, 3, 2, 4) is repeated continuously starting at a(18).
EXAMPLE
The initial values count the following partitions:
4: (4)
5: (4,1)
6: (4,1,1)
6: (4,2)
7: (4,1,1,1)
7: (4,2,1)
7: (4,3)
8: (4,4)
CROSSREFS
KEYWORD
nonn
AUTHOR
Fausto A. C. Cariboni, May 14 2021
STATUS
approved