|
Search: id:A000307
|
|
|
| A000307 |
|
Number of 4-level labeled rooted trees with n leaves.
(Formerly M3590 N1455)
|
|
+0
14
|
|
| 1, 1, 4, 22, 154, 1304, 12915, 146115, 1855570, 26097835, 402215465, 6734414075, 121629173423, 2355470737637, 48664218965021, 1067895971109199, 24795678053493443, 607144847919796830, 15630954703539323090
(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.
R. P. Stanley, Enumerative Combinatorics, Cambridge, Vol. 2, 1999; see Example 5.2.4.
|
|
LINKS
|
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 293
K. A. Penson, P. Blasiak, G. Duchamp, A. Horzela and A. I. Solomon, Hierarchical Dobinski-type relations via substitution and the moment problem [J. Phys. A 37 (2004), 3475-3487]
Index entries for sequences related to rooted trees
K. A. Penson, P. Blasiak, G. Duchamp, A. Horzela and A. I. Solomon, Hierarchical Dobinski-type relations via substitution and the moment problem
Gottfried Helms, Bell Numbers, 2008.
|
|
FORMULA
|
E.g.f.: exp(exp(exp(exp(x)-1)-1)-1).
|
|
CROSSREFS
|
a(n)=|A039812(n, 1)| (first column of triangle). Cf. A000110, A000258, A000357, A000405, A001669.
Sequence in context: A111529 A039304 A062817 this_sequence A049376 A083410 A052772
Adjacent sequences: A000304 A000305 A000306 this_sequence A000308 A000309 A000310
|
|
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
|
