1345680

Appears in sequences

• Number of labeled rooted unordered binary trees (each node has out-degree <= 2).at n=8A036774
• Triangle T(n,k) of k-block ordered tricoverings of an unlabeled n-set (n >= 3, k = 4..2n).at n=13A060492
• Square array whose entry A(n,k) is the number of labeled rooted trees on a set of size n where each node has at most k neighbors that are further away from the root than the node itself, for n >= 0, k >= 0, read by descending antidiagonals.at n=63A325201