|
|
A232055
|
|
Triangular array read by rows: T(n,k) is the number of forests of rooted labeled trees such that the vertex labeled with 1 is in a component (rooted tree) of size k, n>=1, 1<=k<=n.
|
|
0
|
|
|
1, 1, 2, 3, 4, 9, 16, 18, 27, 64, 125, 128, 162, 256, 625, 1296, 1250, 1440, 1920, 3125, 7776, 16807, 15552, 16875, 20480, 28125, 46656, 117649, 262144, 235298, 244944, 280000, 350000, 489888, 823543, 2097152
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
|
|
REFERENCES
|
Miklos Bona, Introduction to Enumerative Combinatorics, McGraw Hill, 2007, page 282.
|
|
LINKS
|
|
|
FORMULA
|
T(n,k) = binomial(n-1,k-1)*k^(k-1)*(n-k+1)^(n-k-1).
|
|
EXAMPLE
|
1;
1, 2;
3, 4, 9;
16, 18, 27, 64;
125, 128, 162, 256, 625;
1296, 1250, 1440, 1920, 3125, 7776;
|
|
MATHEMATICA
|
Table[Table[Binomial[n, k](k+1)(k+1)^(k-1)(n-k+1)^(n-k-1), {k, 0, n}], {n, 0, 7}]//Grid
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|