A polynomial sequence that generalizes the Fibonacci sequence: F(0,x) = 0, F(1,x) = 1, F(n,x) = xF(n-1,x) + F(n-2,x) for n > 1. The first few terms are: F(2,x) = x, F(3,x) = x^2 + 1, F(4,x) = x^3 + 2x, F(5,x) = x^4 + 3x^2 + 1, and so on.
A polynomial sequence that generalizes the Fibonacci sequence: F(0,x) = 0, F(1,x) = 1, F(n,x) = xF(n-1,x) + F(n-2,x) for n > 1. The first few terms are: F(2,x) = x, F(3,x) = x^2 + 1, F(4,x) = x^3 + 2x, F(5,x) = x^4 + 3x^2 + 1, and so on.