1 paper
Sejin Park, Etienne Phillips, Peikai Qi +2
The Fibonacci polynomials are defined recursively as fn(x)=xfn−1(x)+fn−2(x), where f0(x)=0 and f1(x)=1. We generalize these polynomials to an arbitrary number o…