243108

Appears in sequences

• Triangle read by rows: T(n,k) is the number of ternary trees with n edges and such that the first leaf in the preorder traversal is at level k (1<=k<=n). A ternary tree is a rooted tree in which each vertex has at most three children and each child of a vertex is designated as its left or middle or right child.at n=39A121445
• Sum over all partitions lambda of n of binomial(|lambda|, |{lambda}|).at n=24A339006