A knapsack partition is a partition such that for every integer there is at most one way to write it as a sum of a subset of the parts of the partition.
Equivalently, a knapsack partition of n is a multiset of positive integers summing to n such that every distinct submultiset has a different sum.
Information from OEIS
Undergraduate Texts in Mathematics
Graduate Studies in Mathematics
