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!)
A081697 10-level labeled rooted trees with n leaves. 3

%I #13 Feb 04 2016 08:13:51

%S 1,1,10,145,2755,64660,1804705,58336855,2141867440,87998832685,

%T 3998289746065,198991311832840,10762795518750121,628439018694857887,

%U 39390402253060922833,2637469071097179922603,187848412983167698626469,14178423030415044515701642

%N 10-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="/A081697/b081697.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(x)-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!*

%o polcoeff(exp(exp(exp(exp(exp(exp(exp(exp(exp(exp(X)-1)-1)-1)-1)-1)-1)-1)-1)-1),n)).

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

%Y Column k=9 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 25 11:06 EDT 2024. Contains 371967 sequences. (Running on oeis4.)