login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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
0, 1, 2, 4, 7, 13, 24, 44, 84, 161 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

The Conway-Guy 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 Conway-Guy sequence, Proc. AMS 124:12 (1996), pp. 3627-3636.

W. F. Lunnon, Integer sets with distinct subset-sums, Math. Comp. 50 (1988), pp. 297-320.

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 20 23:06 EST 2019. Contains 329348 sequences. (Running on oeis4.)