login

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

A134087
a(n) = [x^n] G(x)^(2^(n+1)) where G(x) satisfies: [x^(n+1)] G(x)^(2^n) = [x^n] G(x)^(2^n) for n>=0 and G(2x) is the g.f. of A134084.
5
1, 4, 32, 672, 42816, 8822400, 6065609984, 14256471226880, 117000916309144576, 3410202131850138806272, 357670541003601468527333376, 136391046228660672398602237353984
OFFSET
0,2
FORMULA
a(n) = 2^n * A134089(n).
PROG
(PARI) {a(n)=local(A=[1], B); for(i=1, n, A=concat(A, 0); B=Vec(Ser(A)^(2^(#A-2))); A[ #A]=(B[ #B-1]-B[ #B])/2^(#A-2)); Vec(Ser(A)^(2^(n+1)))[n+1]}
CROSSREFS
KEYWORD
nonn
AUTHOR
Paul D. Hanna, Oct 26 2007
STATUS
approved