|
Search: id:A052513
|
|
|
| A052513 |
|
Number of labeled trees of height 3. |
|
+0
1
|
|
| 0, 1, 2, 9, 64, 505, 4536, 46249, 526352, 6604497, 90466480, 1341571561, 21392282088, 364715915161, 6616327512536, 127187163197865, 2581443127409056, 55143025567270561, 1236226458392407008
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
LINKS
|
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 59
|
|
FORMULA
|
E.g.f.: x*exp(x*exp(x*exp(x)))
|
|
MAPLE
|
spec := [S, {S=Prod(Z, Set(T1)), T2=Prod(Z, Set(T3)), T3=Z, T1=Prod(Z, Set(T2))}, labeled]: seq(combstruct[count](spec, size=n), n=0..20);
|
|
CROSSREFS
|
Sequence in context: A130169 A076944 A074181 this_sequence A024720 A094100 A067297
Adjacent sequences: A052510 A052511 A052512 this_sequence A052514 A052515 A052516
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
encyclopedia(AT)pommard.inria.fr, Jan 25 2000
|
|
|
Search completed in 0.002 seconds
|
