Sums of Pell/Lucas Polynomials and Fibonacci/Lucas Numbers

: Seven inﬁnite series involving two free variables and central binomial coefﬁcients (in denominators) are explicitly evaluated in closed form. Several identities regarding Pell/Lucas polynomials and Fibonacci/Lucas numbers are presented as consequences.

By means of the linearization method, several 2 F 1 -series with a free variable were evaluated in closed form by the second author [17]. Some of these will be utilized in this paper to show seven algebraic identities (Theorems 1-7) that express infinite series containing two free variables and central binomial coefficients (in denominators) in terms of arcsin-function. As applications, a number of summation formulae involving Pell/Lucas polynomials and Fibonacci/Lucas numbers will be derived consequently. To the best of authors' knowledge, most of the results presented in the propositions and corollaries of this paper are new, except for the inspiration formula (see Corollary 1) found recently by Ohtsuka [16].
In order to facilitate the presentation, it is necessary to review briefly Pell/Lucas polynomials and Fibonacci/Lucas numbers (cf. Koshy [1,2]). The Pell/Lucas polynomials were introduced by Horadam and Mahon [18] that are determined by the same recurrence relations but with different initial conditions P 0 (x) = 0 and P 1 (x) = 1, Q 0 (x) = 2 and Q 1 (x) = 2x.
Their Binet form formulae are given by When x = 1 2 , they become the Fibonacci numbers F n = P n ( 1 2 ) and Lucas numbers L n = Q n ( 1 2 ), respectively. Let φ, ψ = 1± √ 5 2 be two algebraic numbers, with the former being the golden ratio. Then, there are the Binet form expressions: which are valid for all the integers n ∈ Z. Throughout the paper, we shall utilize the following notation for the Gaussian hypergeometric series (cf. Bailey [19], §1.1) where the shifted factorial is defined, for an indeterminate x, by (x) 0 ≡ 1 and (x) n = x(x + 1) · · · (x + n − 1) for n ∈ N.

The First Algebraic Identity and Applications
We begin with the following infinite series identity. An equivalent form of it can be found in Adegoke-Frontczak-Goy [4], Lehmer [20], and Zucker [21].
Proof. Recalling the summation formula (cf. Chu [17], Corollary 11) we can easily deduce the following limit as Making the replacement y → u u+v yields the expression below Consequently, by unifying the two sums and then making use of the following identity for the inverse trigonometric function: we find the summation formula in the theorem.
For an even number m ∈ N, letting u = α m and v = β m , we deduce from Theorem 1 the following identity about Lucas polynomials.
In particular, when x = 1 2 , we confirm the following identity about Lucas numbers, which was proposed recently by Ohtsuka [16] as a problem in "Fibonacci Quarterly". More identities of a similar type were derived recently by Adegoke-Frontczak-Goy [4].

The Second Algebraic Identity and Applications
Now, we examine the identity (cf. Chu [22,23] and Slater [24], §1.5) By shifting the initial term of the 2 F 1 -series to another side and then dividing across by x 2 , we get the equality Keeping in mind that we derive the following summation formula, that its equivalent forms can be located in Lehmer [20], Zucker [21], and Elsner [25].
For an even number m ∈ N, letting u = α m and v = β m , we obtain from Theorem 2 the identity below concerning Pell/Lucas polynomials.
For the special case corresponding to x = 1 2 , we have the following identity involving Fibonacci/Lucas numbers.

The Third Algebraic Identity and Applications
By reindexing n → n − 1, we can rewrite (1) as Subtracting twice (1) from the above equation yields Keeping in mind that we derive the following summation formulae, which is equivalent to those recorded by Lehmer [20], and Zucker [21].
For an even number m ∈ N, letting u = α m and v = β m , we deduce from Theorem 3 two formulae as in the following proposition.
Letting further x = 1 2 result in two series below about Fibonacci/Lucas numbers.

The Fourth Algebraic Identity and Applications
In view of the summation formula (cf. Chu [17], Corollary 12) we can easily deduce the following limit as where we have divided the equation by y 4 . Now, by letting y → u u+v and y → v u+v , and then by adding the two resulting equations, we derive the following formula. Its equivalent forms can be found in two different papers by Adegoke-Frontczak-Goy [4], and Lehmer [20].
For an even number m ∈ N, letting u = α m and v = β m , we deduce from Theorem 4 the infinite series below concerning Lucas polynomials.

Proposition 4 (Even
Especially, letting x = 1 2 , we have the following series involving Lucas numbers.

The Fifth Algebraic Identity and Applications
Recall the formula (cf. Chu [17], Corollary 16), we can derive which reduces as x → 0, to the following formula Then, we can analogously examine the series 3 .
By symmetry, we can evaluate further the sum in the theorem below.
For an even number m ∈ N, letting u = α m and v = β m , we deduce from Theorem 5 the infinite series below concerning Pell/Lucas polynomials.

Proposition 5 (Even
Letting x = 1 2 further, we have the series below regarding Fibonacci/Lucas numbers. Corollary 5 (Even m ∈ N).
In particular, letting x = 1 2 , we have the following infinite series identity involving Lucas numbers.
For an even number m ∈ N, letting u = α m and v = β m , we deduce from Theorem 7 the infinite series below concerning Pell/Lucas polynomials.
Letting x = 1 2 in particular, we have the following infinite series involving Fibonacci/Lucas numbers.
According to Theorems 5 and 8 in [17], the same procedure can be carried out for producing additional infinite series identities. However, the resulting expressions will be more complicated and less elegant. Hence, we shall not pursue further along that direction.

Further Identities on Fibonacci/Lucas Numbers
By assigning different values to u and v in the theorems shown in the previous sections, numerous interesting identities concerning Fibonacci/Lucas numbers can further be derived. We limit ourselves to presenting one representative example for each theorem.
Letting u = 5F 2 m and v = L 2 m in Theorem 1 and then making use of we obtain the following summation formula.
Letting u = F m+1 and v = F m−1 in Theorem 2 and then making use of we get the following summation formula. Letting u = L m+1 and v = L m−1 in Theorem 3 and then making use of we deduce the following summation formula.
Letting u = 5F m F 2m and v = L m L 2m in Theorem 4 and then making use of 5F m F 2m + L m L 2m = 2L 3m and 5F m F 2m × L m L 2m = 5F 2m F 4m , we can prove the following summation formula.
Letting u = F 2 m+1 and v = F 2 m in Theorem 5 and then making use of we can establish the following summation formula.
Letting u = 5F m and v = L m in Theorem 6 and then making use of we can prove the following summation formula.
Finally letting u = F m and v = L m in Theorem 7 and then making use of we can prove the following summation formula.
Up to now, we have restricted ourselves to the value x = 1/2 to exhibit corollaries for applications. Instead, for x = 1, we have the Pell/Lucas numbers P n = P n (1) and Q n = Q n (1). The corresponding Binet form expressions are given by: Therefore for each Proposition, one can directly write down the corresponding formula for Pell/Lucas numbers. In addition, this paper can be considered as a continuation of the authors' recent work [9], where more "bridges" were constructed for passing from Pell/Lucas polynomials to Fibonacci/Lucas numbers (see [9], Equations 2-5). For example, by letting x = √ 5 2 F 2λ , we have P 2m √ 5, and Q 2m Then, applying these relations to Propositions 1, 3 (the first identity), 4 and 5, we can show the following four elegant formulae. Further identities can be deduced analogously.