|
|
A120411
|
|
If A is a set of integers, the (2-fold) sumset consists of all the numbers which can be written as the sum of two (not necessarily distinct) elements in A. a(n) is the number of subsets of [1,2n] which are sumsets for some set of positive integers.
|
|
0
|
|
|
1, 3, 7, 15, 30, 59, 114, 219, 416, 783, 1461, 2722, 5048, 9341, 17243, 31674, 58037, 105936, 192522, 348832
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
a(5)=30 because two of the 31 (nonempty) subsets of [1,5], namely {1,2,4,5} and {1,2,3,4,5} have the sumset {2,3,4,5,6,7,8,9,10} and no two other subsets of [1,5] have the same sumset.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|