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

A193209
G.f. satisfies: A(A(x)) = Sum_{n>=1} a(n)*x^n * (1 + n*x)^n, where g.f. A(x) = Sum_{n>=1} a(n)*x^n.
1
1, 1, 2, 11, 142, 3394, 128368, 7003110, 518966378, 50079318914, 6097188090560, 913799530877734, 165277883587449772, 35492379675559089096, 8926289062300717394696, 2598758767007565055432545, 867087614897934091698944876
OFFSET
1,3
EXAMPLE
G.f.: A(x) = x + x^2 + 2*x^3 + 11*x^4 + 142*x^5 + 3394*x^6 +...
where
A(A(x)) = x*(1+x) + x^2*(1+2*x)^2 + 2*x^3*(1+3*x)^3 + 11*x^4*(1+4*x)^4 + 142*x^5*(1+5*x)^5 + 3394*x^6*(1+6*x)^6 +...+ a(n)*x^n*(1+n*x)^n +...
Explicitly,
A(A(x)) = x + 2*x^2 + 6*x^3 + 33*x^4 + 372*x^5 + 8054*x^6 + 288868*x^7 +...
PROG
(PARI) {a(n)=local(A=[1], F=x, G=x); for(i=1, n, A=concat(A, 0); F=x*Ser(A);
G=sum(m=1, #A-1, A[m]*x^m*(1+m*x +x*O(x^#A))^m );
A[#A]=Vec(G)[#A]-Vec(subst(F, x, F))[#A]); if(n<1, 0, A[n])}
CROSSREFS
Cf. A193210.
Sequence in context: A183609 A113148 A377894 * A268743 A348797 A204243
KEYWORD
nonn
AUTHOR
Paul D. Hanna, Jul 19 2011
STATUS
approved