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 #26 May 07 2012 12:23:48
%S 1,2,15,224,5200,167424,6996122,363310576,22741864200,1677611592480,
%T 143328641594952,13988817772571520,1542398646441873168,
%U 190361863036446487008,26095697861706317389680,3947266360959268571030784,655067435627521423087457280
%N E.g.f. A(x) satisfies A(x-log(1+A(x))) = x.
%F a(n)=n!*T(n,1), T(n,m)=m/n*sum(k=1..n-m, sum(i=k..n-m, T(n-m,i)*stirling1(i,k)*k!/i!)*binomial(n+k-1,n-1)), n>m, T(n,n)=1.
%o (Maxima) array(TL,fixnum,30,30); T(n,m):=if n=m then 1 else if TL[n,m]=0 then TL[n,m]:m/n*sum(sum(T(n-m,i)*stirling1(i,k)*k!/i!,i,k,n-m)*binomial(n+k-1,n-1),k,1,n-m) else TL[n,m]; makelist(n!*T(n,1),n,1,25);
%K nonn
%O 1,2
%A _Vladimir Kruchinin_, May 07 2012