login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A081740 11-level labeled rooted trees with n leaves. 3

%I #13 Feb 04 2016 11:25:30

%S 1,1,11,176,3696,95986,2967041,106296586,4328071506,197304236151,

%T 9951699489061,550054365477936,33053174868315877,2144972900520659506,

%U 149472637758381213628,11130201727845695463914,881841184375010602801553,74061565980075915066583527

%N 11-level labeled rooted trees with n leaves.

%D J. Ginsburg, Iterated exponentials, Scripta Math., 11 (1945), 340-353.

%D T. Hogg and B. A. Huberman, Attractors on finite sets: the dissipative dynamics of computing structures, Phys. Review A 32 (1985), 2338-2346.

%H Alois P. Heinz, <a href="/A081740/b081740.txt">Table of n, a(n) for n = 0..360</a>

%F E.g.f.: exp(exp(exp(exp(exp(exp(exp(exp(exp(exp(exp(x)-1)-1)-1)-1)-1) -1) -1) -1) -1) -1).

%o (PARI) a(n)=local(X); if(n<0,0,X=x+x*O(x^n); n!*polcoeff (exp( exp( exp( exp( exp( exp(exp(exp(exp(exp(exp(X)-1)-1)-1)-1)-1)-1)-1)-1)-1)-1), n))

%Y Cf. A000110, A000258, A000307, A000357, A001669.

%Y Column k=10 of A144150.

%K nonn

%O 0,3

%A _Benoit Cloitre_, Apr 23 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)