Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A081624
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A081624 Number of 8-level labeled rooted trees with n leaves. +0
3
1, 1, 8, 92, 1380, 25488, 558426, 14140722, 406005804, 13024655442, 461451524934, 17886290630832, 752602671853068, 34152212772528222, 1662095923363838817, 86335146917372644026, 4766427291743224251474, 278658370977555551901990 (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(X)-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(X)-1)-1)-1)-1)-1)-1)-1), n))

CROSSREFS

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

Sequence in context: A007556 A027395 A113353 this_sequence A137159 A099291 A087579

Adjacent sequences: A081621 A081622 A081623 this_sequence A081625 A081626 A081627

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 July 6 17:22 EDT 2008. Contains 140988 sequences.


AT&T Labs Research