1092105

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=49A105599
• 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=50A138464
• Number of forests with n labeled nodes and 5 trees.at n=5A240682
• Number of forests with 2n nodes and n labeled trees. Also number of forests with exactly n edges on 2n labeled nodes.at n=5A302112
• Triangle read by rows: T(n,k) is the number of labeled forests with n trees and 2n nodes and with the largest tree having at most k nodes, (n>=1, 2<=k<=n+1).at n=14A332961