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).

A120982

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).