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
1, 1, 11, 176, 3696, 95986, 2967041, 106296586, 4328071506, 197304236151, 9951699489061, 550054365477936, 33053174868315877, 2144972900520659506, 149472637758381213628, 11130201727845695463914, 881841184375010602801553, 74061565980075915066583527 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
REFERENCES
J. Ginsburg, Iterated exponentials, Scripta Math., 11 (1945), 340-353.
T. Hogg and B. A. Huberman, Attractors on finite sets: the dissipative dynamics of computing structures, Phys. Review A 32 (1985), 2338-2346.
LINKS
FORMULA
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).
PROG
(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))
CROSSREFS
Column k=10 of A144150.
Sequence in context: A230388 A027398 A305970 * A051687 A231916 A101791
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Apr 23 2003
STATUS
approved

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 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)