Next Article in Journal
Comprehensive Identification of Surface Subsidence Evaluation Grades of Mines in Southwest China
Previous Article in Journal
Hybrid Deep Learning Applied on Saudi Smart Grids for Short-Term Load Forecasting
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Sums of Pell/Lucas Polynomials and Fibonacci/Lucas Numbers

1
School of Mathematics and Statistics, Zhoukou Normal University, Zhoukou 466001, China
2
Department of Mathematics and Physics, University of Salento, 73100 Lecce, Italy
*
Author to whom correspondence should be addressed.
Mathematics 2022, 10(15), 2667; https://doi.org/10.3390/math10152667
Submission received: 27 June 2022 / Revised: 23 July 2022 / Accepted: 26 July 2022 / Published: 28 July 2022

Abstract

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

1. Introduction and Motivation

As polynomial extensions of the Fibonacci/Lucas numbers, the Pell/Lucas polynomials have many remarkable properties and wide applications in mathematics, physics, and computer sciences (see Koshy [1,2] and Grimaldi [3]). There exist numerous summation formulae involving Fibonacci/Lucas numbers [4,5,6,7,8] and the Pell/Lucas polynomials [9,10,11,12,13,14,15]. Motivated by a beautiful formula (see Corollary 3) due to Ohtsuka [16], we shall investigate in this paper further summation formulae involving inverse central binomial coefficients and Pell/Lucas polynomials, as well as their applications to identities concerning Fibonacci/Lucas numbers.
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
P n ( x ) = 2 x P n 1 ( x ) + P n 2 ( x ) , Q n ( x ) = 2 x Q n 1 ( x ) + Q n 2 ( x ) ;
but with different initial conditions
P 0 ( x ) = 0   and   P 1 ( x ) = 1 , Q 0 ( x ) = 2   and   Q 1 ( x ) = 2 x .
Their Binet form formulae are given by
P n ( x ) = α n β n α β   and   Q n ( x ) = α n + β n ,
where
α : = α ( x ) = x + x 2 + 1   and   β : = β ( x ) = x x 2 + 1 .
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:
F n = ϕ n ψ n ϕ ψ   and   L n = ϕ n + ψ n ,
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)
2 F 1 a , b c | z = n = 0 ( a ) n ( b ) n n ! ( c ) n z n ,
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 .

2. 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].
Theorem 1
(Algebraic identity: u > 0 and v > 0 ).
n = 0 4 n 2 n + 1 u n + v n ( u + v ) n 2 n n 1 = π ( u + v ) 2 u v .
Proof. 
Recalling the summation formula (cf. Chu [17], Corollary 11)
2 F 1 1 + x ,   1 x 3 2 | y 2 = sin ( 2 x arcsin y ) 2 x y 1 y 2 ,
we can easily deduce the following limit as x 0
n = 0 ( 2 y ) 2 n 2 n + 1 2 n n 1 = arcsin y y 1 y 2 .
Making the replacement y u u + v yields the expression below
n = 0 u n 2 n + 1 4 u + v n 2 n n 1 = u + v u v arcsin u u + v .
Consequently, by unifying the two sums
n = 0 u n + v n 2 n + 1 4 u + v n 2 n n 1 = u + v u v arcsin u u + v + arcsin v u + v ,
and then making use of the following identity for the inverse trigonometric function:
arcsin x + arcsin 1 x 2 = π 2 ,   where   x 0 ,
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.
Proposition 1
(Even m N ).
n = 0 Q m n ( x ) 2 n + 1 4 Q m ( x ) n 2 n n 1 = π 2 Q m ( x ) .
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].
Corollary 1
(Even m N ).
n = 0 L m n 2 n + 1 4 L m n 2 n n 1 = π 2 L m .

3. The Second Algebraic Identity and Applications

Now, we examine the identity (cf. Chu [22,23] and Slater [24], §1.5)
2 F 1 x ,   x 1 2 | y 2 = cos ( 2 x arcsin y ) .
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
n = 1 ( 1 + x ) n 1 ( 1 x ) n 1 ( 2 n ) ! ( 2 y ) 2 n = 1 cos ( 2 x arcsin y ) x 2 .
Now, letting x 0 gives the identity
n = 1 ( 2 y ) 2 n n 2 2 n n = 2 arcsin 2 y .
Keeping in mind that
arcsin u u + v arcsin v u + v = arcsin u v u + v ,
we derive the following summation formula, that its equivalent forms can be located in Lehmer [20], Zucker [21], and Elsner [25].
Theorem 2
(Algebraic identity: u > 0 and v > 0 ).
n = 1 4 n ( u n v n ) n 2 ( u + v ) n 2 n n 1 = π arcsin u v u + v .
For an even number m N , letting u = α m and v = β m , we obtain from Theorem 2 the identity below concerning Pell/Lucas polynomials.
Proposition 2
(Even m N ).
n = 1 P m n ( x ) n 2 4 Q m ( x ) n 2 n n 1 = π 2 1 + x 2 arcsin 2 1 + x 2 P m ( x ) Q m ( x ) .
For the special case corresponding to x = 1 2 , we have the following identity involving Fibonacci/Lucas numbers.
Corollary 2
(Even m N ).
n = 1 F m n n 2 4 L m n 2 n n 1 = π 5 arcsin 5 F m L m .

4. The Third Algebraic Identity and Applications

By reindexing n n 1 , we can rewrite (1) as
n = 1 ( 2 y ) 2 n n 2 n n 1 = 2 y arcsin y 1 y 2 .
Subtracting twice (1) from the above equation yields
n = 1 4 n y 2 n + 2 n ( 2 n + 1 ) 2 n n 1 = 2 y 2 2 y 1 y 2 arcsin y .
Keeping in mind that
arcsin u u + v arcsin v u + v = arcsin u v u + v ,
we derive the following summation formulae, which is equivalent to those recorded by Lehmer [20], and Zucker [21].
Theorem 3
(Algebraic identity: u > 0 and v > 0 ).
n = 1 4 n ( u n + 1 ± v n + 1 ) n ( 2 n + 1 ) ( u + v ) n 2 n n 1 = 2 ( u ± v ) 2 u v × π 2 , + ; arcsin u v u + v , .
For an even number m N , letting u = α m and v = β m , we deduce from Theorem 3 two formulae as in the following proposition.
Proposition 3
(Even m N ).
n = 1 Q m n + m ( x ) n ( 2 n + 1 ) 4 Q m ( x ) n 2 n n 1 = 2 Q m ( x ) π ; n = 1 P m n + m ( x ) n ( 2 n + 1 ) 4 Q m ( x ) n 2 n n 1 = 2 P m ( x ) 1 1 + x 2 arcsin 2 1 + x 2 P m ( x ) Q m ( x ) .
Letting further x = 1 2 result in two series below about Fibonacci/Lucas numbers.
Corollary 3
(Even m N ).
n = 1 L m n + m n ( 2 n + 1 ) 4 L m n 2 n n 1 = 2 L m π ; n = 1 F m n + m n ( 2 n + 1 ) 4 L m n 2 n n 1 = 2 F m 2 5 arcsin 5 F m L m .

5. The Fourth Algebraic Identity and Applications

In view of the summation formula (cf. Chu [17], Corollary 12)
2 F 1 1 + x ,   1 x 1 2 | y 2 = cos ( 2 x arcsin y ) 1 y 2 + y sin ( 2 x arcsin y ) 2 x ( 1 y 2 ) 3
we can easily deduce the following limit as x 0
n = 0 4 n y 2 n 4 2 n n = 1 y 4 ( 1 y 2 ) + arcsin y y 3 ( 1 y 2 ) 3 ,
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].
Theorem 4
(Algebraic identity: u > 0 and v > 0 ).
n = 0 4 n u n 2 + v n 2 ( u + v ) n 2 n n 1 = ( u + v ) 2 u 2 v 2 + π ( u + v ) 2 ( u v ) 3 .
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 m N ).
n = 0 Q m n 2 m ( x ) 2 n n 4 Q m ( x ) n = Q m 2 ( x ) + π 2 Q m ( x ) .
Especially, letting x = 1 2 , we have the following series involving Lucas numbers.
Corollary 4
(Even m N ).
n = 0 L m n 2 m 2 n n 4 L m n = L m 2 + π 2 L m .

6. The Fifth Algebraic Identity and Applications

Recall the formula (cf. Chu [17], Corollary 16), we can derive
2 F 1 2 + x ,   2 x 5 2 | y 2 = 3 cos ( 2 x arcsin y ) 4 ( 1 x 2 ) y 2 ( 1 y 2 ) 3 ( 1 2 y 2 ) sin ( 2 x arcsin y ) 8 x ( 1 x 2 ) y 3 ( 1 y 2 ) 3 ,
which reduces as x 0 , to the following formula
n = 0 n + 1 n + 2 ( 2 y ) 2 n 2 n + 3 n + 1 = 1 8 y 2 ( 1 y 2 ) ( 1 2 y 2 ) arcsin y 8 y 3 ( 1 y 2 ) 3 .
Then, we can analogously examine the series
n = 0 n + 1 n + 2 ( 4 u ) n ( u + v ) n 2 n + 3 n + 1 1 = ( u + v ) 2 8 u v + ( u + v ) 2 ( u v ) arcsin u u + v 8 ( u v ) 3 .
By symmetry, we can evaluate further the sum in the theorem below.
Theorem 5
(Algebraic identity: u > 0 and v > 0 ).
n = 1 4 n n + 1 n + 2 u n v n ( u + v ) n 2 n + 3 n + 1 1 = π ( u + v ) 2 ( u v ) 16 ( u v ) 3 .
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 m N ).
n = 1 n + 1 n + 2 P m n ( x ) 2 n + 3 n + 1 4 Q m ( x ) n = π 16 Q m ( x ) P 2 m ( x ) .
Letting x = 1 2 further, we have the series below regarding Fibonacci/Lucas numbers.
Corollary 5
(Even m N ).
n = 1 n + 1 n + 2 F m n 2 n + 3 n + 1 4 L m n = π 16 L m F 2 m .

7. The Sixth Algebraic Identity and Applications

By employing Theorems 5 and 8 in [17], we can derive the following closed formula for Ω 6 , 3 ( x , y ) :
2 F 1 3 + x ,   3 x 7 2 | y 2 = 15 128 x ( 1 + x ) ( 1 x ) ( 2 + x ) ( 2 x ) y 5 ( 1 y 2 ) 5 × 2 ( 2 + x ) ( 2 x ) sin ( 2 x arcsin y ) + ( 1 x ) ( 2 x ) sin ( ( 4 + 2 x ) arcsin y ) ( 1 + x ) ( 2 + x ) sin ( ( 4 2 x ) arcsin y ) .
Its limiting case as x 0 gives that
n = 0 ( n + 1 ) ( n + 2 ) n + 3 ( 2 y ) 2 n 2 n + 5 n + 2 = arcsin y 32 y 5 ( 1 y 2 ) 5 + arcsin y cos ( 4 arcsin y ) 64 y 5 ( 1 y 2 ) 5 3 sin ( 4 arcsin y ) 256 y 5 ( 1 y 2 ) 5 .
By checking, for x 0 , the two equalities below
sin ( 4 arcsin x ) + sin ( 4 arcsin 1 x 2 ) = 0 , arcsin x cos ( 4 arcsin x ) + arcsin 1 x 2 cos ( 4 arcsin 1 x 2 ) = π 2 1 8 x 2 + 8 x 4 ;
we find the following summation formula.
Theorem 6
(Algebraic identity: u > 0 and v > 0 ).
n = 0 4 n ( n + 1 ) ( n + 2 ) n + 3 u n + v n ( u + v ) n 2 n + 5 n + 2 1 = π ( u + v ) 3 ( 3 u 2 2 u v + 3 v 2 ) 128 ( u v ) 5 .
For an even number m N , letting u = α m and v = β m , we deduce from Theorem 6 the infinite series below concerning Lucas polynomials.
Proposition 6
(Even m N ).
n = 0 ( n + 1 ) ( n + 2 ) n + 3 Q m n ( x ) 2 n + 5 n + 2 4 Q m ( x ) n = π 128 Q m 3 ( x ) 3 Q 2 m ( x ) 2 .
In particular, letting x = 1 2 , we have the following infinite series identity involving Lucas numbers.
Corollary 6
(Even m N ).
n = 0 ( n + 1 ) ( n + 2 ) n + 3 L m n 2 n + 5 n + 2 4 L m n = π 128 L m 3 3 L 2 m 2 .

8. The Seventh Algebraic Identity and Applications

Finally, by utilizing again Theorems 5 and 8 in [17], we can derive further the closed formula for Ω 8 , 4 ( x , y ) :
2 F 1 4 + x , 4 x 9 2 | y 2 = 105 128 x ( 1 + x ) ( 2 + x ) ( 3 + x ) ( 1 x ) ( 2 x ) ( 3 x ) y 7 ( 1 y 2 ) 7 × 2 x y 1 y 2 ( 15 44 y 2 4 x 2 y 2 + 44 y 4 + 4 x 2 y 4 ) cos ( 2 x arcsin y ) 3 ( 1 2 y 2 ) ( 5 8 y 2 8 x 2 y 2 + 8 y 4 + 8 x 2 y 4 ) sin ( 2 x arcsin y ) .
Its limiting case as x 0
n = 0 ( n + 1 ) 3 n + 4 ( 2 y ) 2 n 2 n + 7 n + 3 = 15 44 y 2 + 44 y 4 512 y 6 ( 1 y 2 ) 3 3 ( 5 18 y 2 + 24 y 4 16 y 6 ) arcsin y 512 y 7 ( 1 y 2 ) 7
leads us to the following companion formula.
Theorem 7
(Algebraic identity: u > 0 and v > 0 ).
n = 0 4 n ( n + 1 ) 3 n + 4 u n v n ( u + v ) n 2 n + 7 n + 3 1 = 3 π ( u + v ) 4 ( u v ) ( 5 u 2 + 2 u v + 5 v 2 ) 1024 ( u v ) 7 .
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.
Proposition 7
(Even m N ).
n = 0 ( n + 1 ) 3 n + 4 P m n ( x ) 2 n + 7 n + 3 4 Q m ( x ) n = 3 π 1024 P m ( x ) Q m 4 ( x ) 2 + 5 Q 2 m ( x ) .
Letting x = 1 2 in particular, we have the following infinite series involving Fibonacci/Lucas numbers.
Corollary 7
(Even m N ).
n = 0 ( n + 1 ) 3 n + 4 F m n 2 n + 7 n + 3 4 L m n = 3 π 1024 F m L m 4 2 + 5 L 2 m .
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.

9. 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 = 5 F m 2 and v = L m 2 in Theorem 1 and then making use of
5 F m 2 + L m 2 = 2 L 2 m ,
we obtain the following summation formula.
Corollary 8
( m N ).
n = 0 2 n 2 n + 1 5 n F m 2 n + L m 2 n L 2 m n 2 n n 1 = π L 2 m 5 F 2 m .
Letting u = F m + 1 and v = F m 1 in Theorem 2 and then making use of
F m + 1 + F m 1 = L m ,
we get the following summation formula.
Corollary 9
( m N ).
n = 1 4 n n 2 F m + 1 n F m 1 n L m n 2 n n 1 = π arcsin F m L m .
Letting u = L m + 1 and v = L m 1 in Theorem 3 and then making use of
L m + 1 + L m 1 = 5 F m ,
we deduce the following summation formula.
Corollary 10
( m N ).
n = 1 ( 4 / 5 ) n n ( 2 n + 1 ) L m + 1 n + 1 ± L m 1 n + 1 F m n 2 n n 1 = 10 F m π L 2 m 3 ( 1 ) m , + ; 2 L m 2 L 2 m 3 ( 1 ) m arcsin L m 5 F m , .
Letting u = 5 F m F 2 m and v = L m L 2 m in Theorem 4 and then making use of
5 F m F 2 m + L m L 2 m = 2 L 3 m   and   5 F m F 2 m × L m L 2 m = 5 F 2 m F 4 m ,
we can prove the following summation formula.
Corollary 11
( m N ).
n = 0 2 n ( 5 F m F 2 m ) n 2 + ( L m L 2 m ) n 2 L 3 m n 2 n n 1 = 4 L 3 m 2 25 F 2 m 2 F 4 m 2 + π L 3 m ( 5 F 2 m F 4 m ) 3 / 2 .
Letting u = F m + 1 2 and v = F m 2 in Theorem 5 and then making use of
F m + 1 2 + F m 2 = F 2 m + 1 ,
we can establish the following summation formula.
Corollary 12
( m N ).
n = 1 4 n n + 1 n + 2 F m + 1 2 n F m 2 n F 2 m + 1 n 2 n + 3 n + 1 1 = π F 2 m + 1 2 F m 1 F m + 2 16 F m 3 F m + 1 3 .
Letting u = 5 F m and v = L m in Theorem 6 and then making use of
5 F m + L m = 2 L m + 1 ,
we can prove the following summation formula.
Corollary 13
( m N ).
n = 0 2 n ( n + 1 ) ( n + 2 ) n + 3 5 n F m n + L m n L m + 1 n 2 n + 5 n + 2 1 = π   L m + 1 3 16 ( 5 F 2 m ) 5 / 2 75 F m 2 10 F 2 m + 3 L m 2 .
Finally letting u = F m and v = L m in Theorem 7 and then making use of
F m + L m = 2 F m + 1 ,
we can prove the following summation formula.
Corollary 14
( m N ).
n = 0 2 n ( n + 1 ) 3 n + 4 F m n L m n F m + 1 n 2 n + 7 n + 3 1 = 3 π F m + 1 4 64 F 2 m 7 ( F m L m ) 5 F m 2 + 2 F 2 m + 5 L m 2 .
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:
P n = ( 1 + 2 ) n ( 1 2 ) n 2 2   and   Q n = ( 1 + 2 ) n + ( 1 2 ) n .
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 2 m 5 2 F 2 λ = F 4 m λ L 2 λ 5 ,   and   Q 2 m 5 2 F 2 λ = L 4 m λ .
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.
Corollary 15
(Even m N ).
n = 0 L 2 m n λ 2 n + 1 4 L 2 m λ n 2 n n 1 = π 2 L 2 m λ , n = 1 L 2 m n λ + 2 m λ n ( 2 n + 1 ) 4 L 2 m λ n 2 n n 1 = 2 L 2 m λ π , n = 0 L 2 m n λ 4 m λ 2 n n 4 L 2 m λ n = L 2 m λ 2 + π 2 L 2 m λ , n = 1 n + 1 n + 2 F 2 m n λ 2 n + 3 n + 1 4 L 2 m λ n = π 16 L 2 m λ F 4 m λ .

Author Contributions

Writing—original draft & supervision, W.C.; Writing—review & editing, D.G. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Koshy, T. Fibonacci and Lucas Numbers with Applications; John Wiley & Sons: New York, NY, USA, 2001. [Google Scholar]
  2. Koshy, T. Pell and Pell–Lucas Numbers with Applications; Springer: New York, NY, USA, 2014. [Google Scholar]
  3. Grimaldi, R.P. Fibonacci and Catalan Numbers; John Wiley & Sons: Hoboken, NJ, USA, 2012. [Google Scholar]
  4. Adegoke, K.; Frontczak, R.; Goy, T. On a family of infinite series with reciprocal Catalan numbers. Axioms 2022, 11, 165. [Google Scholar] [CrossRef]
  5. Wu, Z.; Zhang, W. The sums of the reciprocals of Fibonacci polynomials and Lucas polynomials. J. Inequal. Appl. 2012, 2012, 134. [Google Scholar] [CrossRef] [Green Version]
  6. Abd-Elhameed, W.M.; Philippou, A.N.; Zeyada, N.A. Novel results for two generalized classes of Fibonacci and Lucas polynomials and their uses in the reduction of some radicals. Mathematics 2022, 10, 2342. [Google Scholar] [CrossRef]
  7. Choo, Y. Relations between generalized bi-periodic Fibonacci and Lucas sequences. Mathematics 2020, 8, 1527. [Google Scholar] [CrossRef]
  8. Ma, Y.; Zhang, W. Some identities involving Fibonacci polynomials and Fibonacci numbers. Mathematics 2018, 6, 334. [Google Scholar] [CrossRef] [Green Version]
  9. Guo, D.; Chu, W. Hybrid convolutions on Pell and Lucas polynomials. Discret. Math. Lett. 2021, 7, 44–51. [Google Scholar]
  10. Cerin, Z.; Gianella, G.M. On sums of squares of Pell–Lucas numbers. Integers 2006, 6, A15. [Google Scholar]
  11. Djordjevic, G.B. Convolutions of the Generalized Pell and Pell-Lucas Numbers. Filomat 2016, 30, 105–112. [Google Scholar] [CrossRef]
  12. Celik, S.; Durukan, I.; Özkan, E. New recurrences on Pell numbers, Pell–Lucas numbers, Jacobsthal numbers, and Jacobsthal–Lucas numbers. Chaos Solitons Fractals 2021, 150, 111173. [Google Scholar] [CrossRef]
  13. Frontczak, R.; Srivastava, H.M.; Tomovski, T. Some families of Apéry-like Fibonacci and Lucas series. Mathematics 2021, 9, 1621. [Google Scholar] [CrossRef]
  14. Tasci, D.; Yalcin, F. Vieta–Pell and Vieta–Pell–Lucas polynomials. Adv. Differ. Equ. 2013, 2013, 224. Available online: http://www.advancesindifferenceequations.com/content/2013/1/224 (accessed on 24 July 2013). [CrossRef] [Green Version]
  15. Trojovský, P. On terms of generalized Fibonacci sequences which are powers of their indexes. Mathematics 2019, 7, 700. [Google Scholar] [CrossRef] [Green Version]
  16. Ohtsuka, H. Problem B-1295. Fibonacci Quart. 2021, 59, 274. [Google Scholar]
  17. Chu, W. Trigonometric expressions for Gaussian 2F1-series. Turk. J. Math. 2019, 43, 1823–1836. [Google Scholar] [CrossRef] [Green Version]
  18. Horadam, A.F.; Mahon, B.J.M. Pell and Pell–Lucas polynomials. Fibonacci Quart. 1985, 23, 7–20. [Google Scholar]
  19. Bailey, W.N. Generalized Hypergeometric Series; Cambridge University Press: Cambridge, UK, 1935. [Google Scholar]
  20. Lehmer, D.H. Interesting series involving the central binomial coefficient. Am. Math. Mon. 1985, 92, 449–457. [Google Scholar] [CrossRef]
  21. Zucker, I.J. On the series k = 1 2 k k 1 k n . J. Number Theory 1985, 20, 92–102. [Google Scholar] [CrossRef] [Green Version]
  22. Chu, W. Summations on trigonometric functions. Appl. Math. Comput. 2003, 141, 161–176. [Google Scholar] [CrossRef]
  23. Chu, W. Evaluation of nonterminating hypergeometric 3 F 2 3 4 -series. J. Math. Anal. Appl. 2017, 450, 490–503. [Google Scholar] [CrossRef]
  24. Slater, L.J. Generalized Hypergeoemtric Functions; Cambridge University Press: Cambridge, UK, 1966. [Google Scholar]
  25. Elsner, C. On sums with binomial coefficient. Fibonacci Quart. 2005, 43, 31–45. [Google Scholar]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Guo, D.; Chu, W. Sums of Pell/Lucas Polynomials and Fibonacci/Lucas Numbers. Mathematics 2022, 10, 2667. https://doi.org/10.3390/math10152667

AMA Style

Guo D, Chu W. Sums of Pell/Lucas Polynomials and Fibonacci/Lucas Numbers. Mathematics. 2022; 10(15):2667. https://doi.org/10.3390/math10152667

Chicago/Turabian Style

Guo, Dongwei, and Wenchang Chu. 2022. "Sums of Pell/Lucas Polynomials and Fibonacci/Lucas Numbers" Mathematics 10, no. 15: 2667. https://doi.org/10.3390/math10152667

APA Style

Guo, D., & Chu, W. (2022). Sums of Pell/Lucas Polynomials and Fibonacci/Lucas Numbers. Mathematics, 10(15), 2667. https://doi.org/10.3390/math10152667

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop