|
| |
|
|
A052514
|
|
Number of labeled trees of height 4.
|
|
3
| |
|
|
0, 1, 2, 9, 64, 625, 7056, 89929, 1284032, 20351601, 354648160, 6736612201, 138472331328, 3061103815081, 72391319923664, 1823032999274985, 48692068509655936, 1374488205290880481, 40877130077266074048
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
LINKS
| INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 60
|
|
|
FORMULA
| E.g.f.: x*exp(x*exp(x*exp(x*exp(x))))
|
|
|
MAPLE
| spec := [S, {T2=Prod(Z, Set(T3)), S=Prod(Z, Set(T1)), T4=Z, T3=Prod(Z, Set(T4)), T1=Prod(Z, Set(T2))}, labeled]: seq(combstruct[count](spec, size=n), n=0..20);
|
|
|
CROSSREFS
| Sequence in context: A036775 A141209 A128577 * A036776 A036777 A055860
Adjacent sequences: A052511 A052512 A052513 * A052515 A052516 A052517
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| encyclopedia(AT)pommard.inria.fr, Jan 25 2000
|
| |
|
|
