|
Search: id:A071208
|
|
|
| A071208 |
|
Triangular array T(n,k) read by rows, giving number of labeled free trees such that the root is smaller than all its children, with respect to the number n of vertices and to the number k of decreasing edges. |
|
+0
1
|
|
| 1, 2, 2, 6, 15, 6, 24, 104, 104, 24, 120, 770, 1345, 770, 120, 720, 6264, 16344, 16344, 6264, 720, 5040, 56196, 200452, 300167, 200452, 56196, 5040, 40320, 554112, 2552192, 5241984, 5241984, 2552192, 554112, 40320, 362880, 5973264, 34138908
(list; table; graph; listen)
|
|
|
OFFSET
|
2,2
|
|
|
REFERENCES
|
C. Chauve, S. Dulucq and O. Guibert, Enumeration of some labeled trees, Proceedings of FPSAC/SFCA 2000 (Moscow), Springer, pp. 146-157.
|
|
MAPLE
|
(n, k) -> sum((-1)^(m+k+1)*binomial(m, k+1)*(-1)^(m)*stirling1(n+1, n+1-m)*n^(n-m), m=k+1..n)
|
|
CROSSREFS
|
Cf. A000312.
Sequence in context: A142710 A014431 A142471 this_sequence A083555 A001464 A067136
Adjacent sequences: A071205 A071206 A071207 this_sequence A071209 A071210 A071211
|
|
KEYWORD
|
easy,nonn,tabl
|
|
AUTHOR
|
Cedric Chauve (chauve(AT)lacim.uqam.ca), May 16 2002
|
|
|
Search completed in 0.002 seconds
|
