

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.


2




OFFSET

0,3


COMMENTS

The ConwayGuy sequence A005318 is an upper bound. Lunnon showed that a(67) < 34808838084768972989 = A005318(67), and Bohman improved the bound to a(67) <= 34808712605260918463.
Lunnon found a(0)a(8) and J. P. Grossman found a(9).


LINKS

Table of n, a(n) for n=0..9.
Tom Bohman, A sum packing problem of ErdÅ‘s and the ConwayGuy sequence, Proc. AMS 124:12 (1996), pp. 36273636.
W. F. Lunnon, Integer sets with distinct subsetsums, Math. Comp. 50 (1988), pp. 297320.


CROSSREFS

Cf. A005318.
Sequence in context: A000073 A255069 A160254 * A005318 A102111 A224704
Adjacent sequences: A276658 A276659 A276660 * A276662 A276663 A276664


KEYWORD

nonn,hard,more,nice


AUTHOR

Charles R Greathouse IV and J. P. Grossman, Sep 11 2016


STATUS

approved



