47313

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=30A121445
• Number of primitive Heron triangles with diameter <= 2^n.at n=11A208979
• The hyper-Wiener index of the hexagonal triangle T_n, defined in the He et al. reference.at n=6A248094
• Expansion of Product_{n>=1} (1 - x^(3*n))/(1 - x^n)^2 in powers of x.at n=24A278690
• Number of n-step self-avoiding walks on the half-Manhattan lattice with no non-contiguous adjacencies.at n=16A336726