The Fibonacci polynomials are the polynomials obtained by setting
and
in the Lucas polynomial sequence. (The
corresponding
polynomials are called Lucas
polynomials.) They have explicit formula
|
(1)
|
for nonnegative integers . At
, the quotient formulas
are interpreted by their limits.
The Fibonacci polynomial is implemented in the Wolfram
Language as Fibonacci[n,
x].
The Fibonacci polynomials are defined by the recurrence relation
|
(2)
|
for , with
and
.
The first few Fibonacci polynomials are
|
(3)
| |||
|
(4)
| |||
|
(5)
| |||
|
(6)
| |||
|
(7)
|
For , the coefficients
of
are the absolute values of row
in OEIS A049310.
The Fibonacci polynomials have generating function
|
(8)
| |||
|
(9)
| |||
|
(10)
|
The Fibonacci polynomials are normalized so that
|
(11)
|
where the s
are Fibonacci numbers.
For a positive integer ,
is also given by the explicit sum formula
|
(12)
|
where
is the floor function and
is a binomial coefficient.
For , the derivative
of
is given by
|
(13)
|
For positive integers and
, the Fibonacci polynomials have
the divisibility property
divides
iff
divides
. For prime
,
is an irreducible
polynomial over the rational numbers. The
zeros of
are
for
, ...,
(Koshy 2001, p. 462). For odd prime
, these roots
are
times the real part of the nontrivial roots
of the
th
cyclotomic polynomial.
The identity
|
(14)
|
for , 3, ... and
a Chebyshev
polynomial of the second kind gives the identities
|
(15)
| |||
|
(16)
| |||
|
(17)
| |||
|
(18)
|
and so on, where
for
, 5, 7, ... gives the sequence 4, 11, 29, ... (OEIS
A002878).
The Fibonacci polynomials are related to the Morgan-Voyce polynomials by
|
(19)
| |||
|
(20)
|
(Swamy 1968).