cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A126391 a(1)=1; for n>1: a(n) = sum of all subsets of (a(1),..,a(n-1)).

Original entry on oeis.org

1, 1, 4, 24, 240, 4320, 146880, 9694080, 1260230400, 325139443200, 167121673804800, 171466837323724800, 351507016513635840000, 1440475753672879672320000, 11803258325595576034990080000
Offset: 1

Views

Author

Zak Seidov, Mar 23 2007

Keywords

Comments

Is connection with A006088 clear?
Apparently first differences of A028361. - Sean A. Irvine, Jun 25 2022

Examples

			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.
		

Crossrefs

Cf. A006088.

Programs

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

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).