77448

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=48A143396
• Number of permutations of 0..(n-1) representable as consecutive sums of 3 adjacent elements of a sequence of n+2 nonnegative integers.at n=10A180206
• Number of forests of labeled rooted trees of height at most 1, with n labels, three of which are used for root nodes and any root may contain >= 1 labels.at n=6A273653