Return an `l`-length sequence of nonnegative integers such that any `n`-length-or-shorter combination of members with repeats allowed can be uniquely identified by its sum.
The optimal solution is the one with the lowest maximum-member.
(If that were "product" instead of "sum", the obvious solution would be the first `l` primes.)