241029

Appears in sequences

• Number of unlabeled forests on n nodes that have exactly two nonempty components.at n=19A274937
• Number of unlabeled forests with n nodes that have two components, neither of which is the empty graph.at n=19A274938
• Irregular triangular array read by rows. T(n,k) is the number of unlabeled forests of distinct trees on n nodes containing exactly k trees.at n=62A336096