Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A081629
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A081629 Number of 9-level labeled rooted trees with n leaves. +0
5
1, 1, 9, 117, 1989, 41709, 1038975, 29947185, 979687005, 35839643175, 1449091813035, 64144495494825, 3084209792570721, 160023238477245789, 8909102551102555002, 529651263967161225648, 33482356679629151295651 (list; graph; listen)
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.

FORMULA

E.g.f. exp(exp(exp(exp(exp(exp(exp(exp(exp(X)-1)-1)-1)-1)-1)-1)-1)-1)

PROGRAM

(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(X)-1)-1)-1)-1)-1)-1)-1)-1), n))

CROSSREFS

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

Adjacent sequences: A081626 A081627 A081628 this_sequence A081630 A081631 A081632

Sequence in context: A059967 A027396 A113344 this_sequence A051617 A087984 A130652

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 23 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 13 09:05 EDT 2008. Contains 145008 sequences.


AT&T Labs Research