|
Search: id:A000405
|
|
|
| A000405 |
|
Number of 6-level labeled rooted trees with n leaves.
(Formerly M4261 N1781)
|
|
+0
7
|
|
| 1, 1, 6, 51, 561, 7556, 120196, 2201856, 45592666, 1051951026, 26740775306, 742069051906, 22310563733864, 722108667742546, 25024187820786357, 924161461265888370, 36223781285638309482, 1501552062016443881514
(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.
|
|
LINKS
|
Index entries for sequences related to rooted trees
P. J. Cameron, Sequences realized by oligomorphic permutation groups, J. Integ. Seqs. Vol. 3 (2000), #00.1.5.
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 295
Gottfried Helms, Bell Numbers, 2008.
|
|
FORMULA
|
E.g.f.: exp(exp(exp(exp(exp(exp(x)-1)-1)-1)-1)-1).
|
|
CROSSREFS
|
Cf. A000110, A000258, A000307, A000357, A001669.
Sequence in context: A027393 A124565 A057817 this_sequence A113352 A063169 A134525
Adjacent sequences: A000402 A000403 A000404 this_sequence A000406 A000407 A000408
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
Extended with new definition by Christian G. Bower (bowerc(AT)usa.net), Aug 15 1998.
|
|
|
Search completed in 0.002 seconds
|
