341082

Appears in sequences

• Triangle T(n,k) = number of forests of labeled rooted trees of height at most 1, with n labels, k of which are used for root nodes and any root may contain >= 1 labels, n >= 0, 0<=k<=n.at n=49A143396
• Number of forests of labeled rooted trees of height at most 1, with n labels, four of which are used for root nodes and any root may contain >= 1 labels.at n=5A273654