References to A201052

a(n) is the maximal number c of integers that can be chosen from {1,2,...,n} so that all 2^c subsets have distinct sums.
1, 2, 2, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6


1 seqfan posts

Sun Nov 27 18:10:20 CET 2011    [seqfan] overlooked sequences

Index of A-numbers in seqfan: by ascending order    by month    by frequency    by keyword
Links to OEIS content are included according to The OEIS End-User License Agreement .