We generate Fibonacci-type recursive polynomials through continued fractions. These polynomials generalize the well-known Fibonacci and Lucas polynomials. We present several results such as generating functions, finite sum representations and identities satisfied by these polynomials. Analytic results about the zeros of these polynomials are also presented.
"Some remarks on generalized recursive polynomials." Involve 14 (2) 181 - 194, 2021. https://doi.org/10.2140/involve.2021.14.181