OFFSET
0,10
COMMENTS
An integer partition is knapsack if every distinct submultiset has a different sum.
I computed terms a(n) for n = 0..25000 and the subsequence a(72)-a(491) of length 420 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:
7: (7)
8: (7,1)
9: (7,1,1), (7,2)
10: (7,1,1,1), (7,2,1), (7,3)
CROSSREFS
KEYWORD
nonn
AUTHOR
Fausto A. C. Cariboni, May 17 2021
STATUS
approved