Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A120411
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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
1, 3, 7, 15, 30, 59, 114, 219, 416, 783, 1461, 2722, 5048 (list; graph; listen)
OFFSET

1,2

EXAMPLE

a(5)=30 because two of the 31 (non-empty) 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

Sequence in context: A058695 A023610 A062544 this_sequence A069112 A064084 A090633

Adjacent sequences: A120408 A120409 A120410 this_sequence A120412 A120413 A120414

KEYWORD

nonn

AUTHOR

David Newman (DavidSNewman(AT)gmail.com), Jul 05 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research