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!)
A081624 Number of 8-level labeled rooted trees with n leaves. 5
1, 1, 8, 92, 1380, 25488, 558426, 14140722, 406005804, 13024655442, 461451524934, 17886290630832, 752602671853068, 34152212772528222, 1662095923363838817, 86335146917372644026, 4766427291743224251474, 278658370977555551901990 (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(x)-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(X)-1)-1)-1)-1)-1)-1)-1), n))
CROSSREFS
Column k=7 of A144150.
Sequence in context: A255520 A305967 A113353 * A298188 A299083 A184142
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 May 2 11:31 EDT 2024. Contains 372196 sequences. (Running on oeis4.)