A276661
Least k such that there is a set S in {1, 2, …, k} with n elements and the property that each of its subsets has a distinct sum.
offset: 0
codomain: ℕ
The OEIS sequence has the tags “hard” and/or “more” and few known values. It is likely that the Lean code is not representing the actual sequence, even though it coincides in the known values.
Declarations
Section titled “Declarations”- A276661computable