201785

Appears in sequences

• Number of ways of transforming a set of n indistinguishable objects into n singletons via a sequence of n-1 refinements.at n=12A002846
• Least k such that first k terms of A006928 contain n more 1's than 2's.at n=27A025506
• Number of nonempty subsets of {1,2,...,n} in which exactly 3/4 of the elements are <= (n-2)/2.at n=26A047186
• In the ranked poset of integer partitions ordered by refinement, number of maximal chains from the local minimum to the partition with Heinz number n.at n=40A300384