230700

Appears in sequences

• a(n) is the number of forests with n nodes of rooted unlabeled identity trees.at n=18A052843
• Triangle read by rows: T(n,k) is the number of length n words over an n-ary alphabet such that the maximal cardinality of C is k, where C is a subset of the alphabet such that all letters in C appear in weakly increasing order within the word.at n=31A387336