login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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

%I #13 Dec 13 2015 23:08:17

%S 1,3,7,15,30,59,114,219,416,783,1461,2722,5048,9341,17243,31674,58037,

%T 105936,192522,348832

%N 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.

%C The relation a(n+1)-a(n) = A190820(n) seems to hold. - _Giovanni Resta_, Jan 15 2013

%e 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.

%K nonn,more

%O 1,2

%A _David S. Newman_, Jul 05 2006

%E a(14)-a(20) from _Carl Najafi_, Jan 15 2013

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 20:05 EDT 2024. Contains 371254 sequences. (Running on oeis4.)