Svoboda | Graniru | BBC Russia | Golosameriki | Facebook
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
1, 1, 10, 145, 2755, 64660, 1804705, 58336855, 2141867440, 87998832685, 3998289746065, 198991311832840, 10762795518750121, 628439018694857887, 39390402253060922833, 2637469071097179922603, 187848412983167698626469, 14178423030415044515701642 (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(x)-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(X)-1)-1)-1)-1)-1)-1)-1)-1)-1), n)).
CROSSREFS
Column k=9 of A144150.
Sequence in context: A113354 A027397 A305969 * A134526 A297714 A055761
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 September 10 19:10 EDT 2024. Contains 375794 sequences. (Running on oeis4.)