2096752

Appears in sequences

• Number of labeled rooted trees with a degree constraint (described in the comments below).at n=8A036777
• Consider the 2^(n-1)-1 nonempty subsets S of {1, 2, ..., n-1}; a(n) gives number of such S for which it is impossible to partition n into parts from S such that each s in S is used at least once.at n=21A070880