293547

Appears in sequences

• Wedderburn-Etherington numbers: unlabeled binary rooted trees (every node has outdegree 0 or 2) with n endpoints (and 2n-1 nodes in all).at n=20A001190
• Number of n-node rooted unlabeled trees with outdegree <= 2 and exactly 1 edge at the root.at n=20A036656
• Numerator of sum of numbers in set g(n) generated as in Comments.at n=11A264200
• Number of rooted binary trees (in which all inner nodes have precisely two children) with n leaves and with maximal number of cherries (i.e., maximal number of pendant subtrees with two leaves).at n=39A344613