The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
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; text; internal format)
OFFSET
1,3
COMMENTS
Is connection with A006088 clear?
Apparently first differences of A028361. - Sean A. Irvine, Jun 25 2022
LINKS
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: A239840 A052718 A061640 * A006088 A325963 A141013
KEYWORD
nonn
AUTHOR
Zak Seidov, Mar 23 2007
STATUS
approved

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 May 21 05:34 EDT 2024. Contains 372728 sequences. (Running on oeis4.)