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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A126391 a(1)=1; for n>1: a(n) = sum of all subsets of (a(1),..,a(n-1)). 0
1, 1, 4, 24, 240, 4320, 146880, 9694080, 1260230400, 325139443200, 167121673804800, 171466837323724800, 351507016513635840000, 1440475753672879672320000, 11803258325595576034990080000 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

COMMENTS

Is connection with A006088 clear?

FORMULA

a(1)=1, a(2)=1; n>2: a(n)=(2^(n-2)+2)*a(n-1). a(1)=1; n>1: a(n)=A006088(n-1).

EXAMPLE

n=2: subsets of (1) are ((0),(1)), sums of subsets are (0,1) and total sum is 0+1=1, hence a(2)=1;

n=3: subsets of (1,1) are ((0),(1),(1),(1,1)), sums of subsets are (0,1,1,2) and total sum is 0+1+1+2=4, hence a(3)=4;

n=4: subsets of (1,1,4) are ((0),(1),(1),(4),(1,1),(1,4),(1,4),(1,1,4)), sums of subsets are (0,1,1,4,2,5,5,6) and total sum is 0+1+1+4+2+5+5+6=24, hence a(4)=24.

MATHEMATICA

a[1]=1; a[2]=1; a[n_]:=a[n]=(2^(n-2)+2)*a[n-1]; Table[a[i], {i, 18}]

CROSSREFS

Cf. A006088.

Sequence in context: A074598 A052718 A061640 * A006088 A141013 A176785

Adjacent sequences:  A126388 A126389 A126390 * A126392 A126393 A126394

KEYWORD

nonn

AUTHOR

Zak Seidov (zakseidov(AT)gmail.com), Mar 23 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 14:37 EST 2012. Contains 205930 sequences.