24811920

Appears in sequences

• Number of labeled rooted unordered binary trees (each node has out-degree <= 2).at n=9A036774
• 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=75A325201