Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #5 Jun 25 2022 22:52:52
%S 1,1,4,24,240,4320,146880,9694080,1260230400,325139443200,
%T 167121673804800,171466837323724800,351507016513635840000,
%U 1440475753672879672320000,11803258325595576034990080000
%N a(1)=1; for n>1: a(n) = sum of all subsets of (a(1),..,a(n-1)).
%C Is connection with A006088 clear?
%C Apparently first differences of A028361. - _Sean A. Irvine_, Jun 25 2022
%F 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).
%e 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;
%e 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;
%e 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.
%t a[1]=1;a[2]=1;a[n_]:=a[n]=(2^(n-2)+2)*a[n-1];Table[a[i],{i,18}]
%Y Cf. A006088.
%K nonn
%O 1,3
%A _Zak Seidov_, Mar 23 2007