2505228

Appears in sequences

• Number of proper diagonals of the n-dimensional associahedron (i.e., diagonals that are not included in lower dimension faces).at n=7A257887
• Triangle read by rows: T(n,k) is the number of planar tanglegrams of size n with 0 <= k < n leaf-matched pairs. A leaf matched pair is a pair of non-leaf vertices (u,v) in the tanglegram such that the induced subtrees rooted and u and v also form a tanglegram (equivalently, the leaves in these two subtrees are matched by the matching that forms the original tanglegram).at n=46A349409
• Triangle read by rows: T(n,k) is the number of planar tanglegrams of size n with irreducible component of size k.at n=54A371659