1316574

Appears in sequences

• Triangle read by rows: T(n, m) = number of forests with n nodes and m labeled trees. Also number of forests with exactly n - m edges on n labeled nodes.at n=38A105599
• Triangle read by rows: T(n, k) is the number of forests on n labeled nodes with k edges. T(n, k) for n >= 1 and 0 <= k <= n-1.at n=42A138464
• Number of forests with three connected components in the complete graph K_{n}.at n=8A239910