87735

Appears in sequences

• a(n) = Sum_{k=0..n} T(n,k), T given by A026758.at n=15A026765
• Number of n-node rooted labeled trees with deg <= 4 at root and outdegree <= 2 elsewhere.at n=16A036661
• Triangle read by rows: T(n,k) is the number of ternary trees with n edges and having k vertices of outdegree 2 (n >= 0, k >= 0).at n=25A120982
• Number of ternary trees with n edges and having no vertices of degree 2. 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=9A120985
• Number of rooted unlabeled trees on n nodes where each node has at most 9 children.at n=15A292554