46628

Appears in sequences

• a(n) is the number of forests with n (unlabeled) nodes in which each component tree is planted, that is, is a rooted tree in which the root has degree 1.at n=14A005198
• Expansion of (1/(1 - x)) * Product_{k>=1} 1/(1 - k*x^k/(1 - x)^k).at n=10A318127
• Number T(n,k) of colored compositions of n using all colors of a k-set such that all parts have different color patterns and the patterns for parts i have i colors in (weakly) increasing order; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=32A327245
• Triangle read by rows. Number T(n, k) of partitions of the multiset [1, 1, 1, 1, 2, 2, 2, 2, ..., n, n, n, n] into k nonempty submultisets, for 1 <= k <= 4n.at n=55A358722