Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A081697
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A081697 10-level labeled rooted trees with n leaves. +0
2
1, 1, 10, 145, 2755, 64660, 1804705, 58336855, 2141867440, 87998832685, 3998289746065, 198991311832840, 10762795518750121, 628439018694857887, 39390402253060922833, 2637469071097179922603, 187848412983167698626469 (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(exp(X)-1)-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(exp(X)-1)-1)-1)-1)-1)-1)-1)-1)-1), n))

CROSSREFS

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

Sequence in context: A059968 A113354 A027397 this_sequence A134526 A055761 A095889

Adjacent sequences: A081694 A081695 A081696 this_sequence A081698 A081699 A081700

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 November 30 22:12 EST 2008. Contains 150989 sequences.


AT&T Labs Research