Properties of Motzkin triangle and \(t\)-generalized Motzkin sequences (Q2142586)

The \(n\)th Motzkin number is the number of different ways of drawing non-intersecting chords between \(n\) points on a circle (not necessarily touching every point by a chord). The Motzkin numbers are named after Theodore Motzkin and have diverse applications in geometry, combinatorics, and number theory. In the related paper, the Motzkin triangle (like Pascal's triangle) including Motzkin numbers is considered as the zero-free part of a well-defined plane array. The right diagonal leg of the triangle is the Motzkin sequence, which satisfies a second-order linear recurrence with linear polynomial coefficients. They extended this relation to the parallel diagonals to the line of the Motzkin sequence. More generally, the existence of a recursive formula for the formation of three arbitrary elements in the triangle is shown, and the corresponding formulae for three connected entries, among them diagonal triples, of twenty possible formations are investigated. These recursive formulae have bivariate polynomial coefficients of higher order. The columns of the Motzkin triangle are described as polynomial values and reveal nice non-trivial factorization properties of these polynomials.