We give a combinatorial proof of an elementary property of generalized Lucas polynomials, inspired by . These polynomials in s and t are defined by the recurrence relation 〈n〉 = s〈n-1〉+t〈n-2〉 for n ≥ 2. The initial values are 〈0〉 = 2; 〈1〉= s, respectively.
Demonstratio Mathematica, founded in 1969, is a fully peer-reviewed, open access journal that publishes original and significant research works and review articles devoted to functional analysis, approximation theory, and related topics. The journal provides the readers with free, instant, and permanent access to all content worldwide (all 53 volumes are available online!)