Loading [MathJax]/jax/output/SVG/jax.js
Research article

Some new identities of a type of generalized numbers involving four parameters

  • Received: 16 March 2022 Revised: 25 April 2022 Accepted: 26 April 2022 Published: 07 May 2022
  • MSC : 11B39, 11B83

  • This article deals with a Horadam type of generalized numbers involving four parameters. These numbers generalize several celebrated numbers in the literature such as the generalized Fibonacci, generalized Lucas, Fibonacci, Lucas, Pell, Pell-Lucas, Fermat, Fermat-Lucas, Jacobsthal, Jacobsthal-Lucas, balancing, and co-balancing numbers. We present some new identities concerned with the generalized numbers of four parameters. An explicit expression for these numbers is developed, and a mixed recurrence relation between two certain families of the generalized numbers is given, and after that, some new identities are presented and proved. A large number of identities between several celebrated numbers are obtained as special cases of our developed ones. Furthermore, some of the identities that were previously published in other articles can be deduced as special ones of our new identities.

    Citation: Waleed Mohamed Abd-Elhameed, Amr Kamel Amin, Nasr Anwer Zeyada. Some new identities of a type of generalized numbers involving four parameters[J]. AIMS Mathematics, 2022, 7(7): 12962-12980. doi: 10.3934/math.2022718

    Related Papers:

    [1] Yulei Chen, Yingming Zhu, Dongwei Guo . Combinatorial identities concerning trigonometric functions and Fibonacci/Lucas numbers. AIMS Mathematics, 2024, 9(4): 9348-9363. doi: 10.3934/math.2024455
    [2] Kritkhajohn Onphaeng, Prapanpong Pongsriiam . Exact divisibility by powers of the integers in the Lucas sequence of the first kind. AIMS Mathematics, 2020, 5(6): 6739-6748. doi: 10.3934/math.2020433
    [3] Ümit Tokeşer, Tuğba Mert, Yakup Dündar . Some properties and Vajda theorems of split dual Fibonacci and split dual Lucas octonions. AIMS Mathematics, 2022, 7(5): 8645-8653. doi: 10.3934/math.2022483
    [4] Tingting Du, Zhengang Wu . Some identities involving the bi-periodic Fibonacci and Lucas polynomials. AIMS Mathematics, 2023, 8(3): 5838-5846. doi: 10.3934/math.2023294
    [5] Tingting Du, Zhengang Wu . Some identities of the generalized bi-periodic Fibonacci and Lucas polynomials. AIMS Mathematics, 2024, 9(3): 7492-7510. doi: 10.3934/math.2024363
    [6] Tingting Du, Li Wang . On the power sums problem of bi-periodic Fibonacci and Lucas polynomials. AIMS Mathematics, 2024, 9(4): 7810-7818. doi: 10.3934/math.2024379
    [7] Utkal Keshari Dutta, Prasanta Kumar Ray . On the finite reciprocal sums of Fibonacci and Lucas polynomials. AIMS Mathematics, 2019, 4(6): 1569-1581. doi: 10.3934/math.2019.6.1569
    [8] Man Chen, Huaifeng Chen . On ideal matrices whose entries are the generalized kHoradam numbers. AIMS Mathematics, 2025, 10(2): 1981-1997. doi: 10.3934/math.2025093
    [9] Faik Babadağ . A new approach to Jacobsthal, Jacobsthal-Lucas numbers and dual vectors. AIMS Mathematics, 2023, 8(8): 18596-18606. doi: 10.3934/math.2023946
    [10] Waleed Mohamed Abd-Elhameed, Omar Mazen Alqubori . New expressions for certain polynomials combining Fibonacci and Lucas polynomials. AIMS Mathematics, 2025, 10(2): 2930-2957. doi: 10.3934/math.2025136
  • This article deals with a Horadam type of generalized numbers involving four parameters. These numbers generalize several celebrated numbers in the literature such as the generalized Fibonacci, generalized Lucas, Fibonacci, Lucas, Pell, Pell-Lucas, Fermat, Fermat-Lucas, Jacobsthal, Jacobsthal-Lucas, balancing, and co-balancing numbers. We present some new identities concerned with the generalized numbers of four parameters. An explicit expression for these numbers is developed, and a mixed recurrence relation between two certain families of the generalized numbers is given, and after that, some new identities are presented and proved. A large number of identities between several celebrated numbers are obtained as special cases of our developed ones. Furthermore, some of the identities that were previously published in other articles can be deduced as special ones of our new identities.



    Fibonacci and Lucas polynomials and their corresponding numbers play important parts in various disciplines. Fibonacci numbers arise in quite unexpected places. For example, they appear in nature, geography, and geometry. For some applications of these numbers, one can consult [1]. A large number of contributions were devoted to establishing formulas concerned with these polynomials and their corresponding numbers. For example, the authors in [2] found some results regarding the finite reciprocal sums of Fibonacci and Lucas polynomials. The authors in [3] derived some power sums of Fibonacci and Lucas numbers. New formulas of Fibonacci and Lucas numbers involving the golden ratio are developed in [4]. Some other contributions concerning these sequences of numbers and some of their related sequences can be found in [5,6,7,8,9].

    Several types of sequences that generalize the standard Fibonacci and Lucas sequences are introduced and investigated in a variety of contributions by many authors. In [10], Muskat considered two classes of generalized Fibonacci and generalized Lucas numbers, and some root-finding methods are applied. In [11], Trojovskỳ considered a k generalized Fibonacci sequence and found solutions to a certain Diophantine equation. The authors in [12] developed some relationships between some numbers related to Fibonacci and Lucas numbers. In [13], a new approach to generalized Fibonacci and Lucas numbers with binomial coefficients is followed. A generalized k-Horadam sequence is investigated in [14]. In [15], the authors developed some identities concerning k-balancing and k-Lucas-balancing numbers. A type of generalized Fibonacci numbers is introduced and investigated in [16]. The authors in [17] solved a quadratic Diophantine equation involving the generalized Fibonacci numbers. In [18], some arithmetic properties and new pseudo primality results for the generalized Lucas sequences were provided. Some arithmetic properties of the generalized Lucas sequences are developed in [19]. The authors in [20] introduced and investigated distance Fibonacci Polynomials. There are interesting numbers in the literature that can be considered special ones of various generalized Fibonacci numbers and generalized Lucas numbers. For example, the celebrated numbers, namely, Jacobsthal, Jacobsthal-Lucas, balancing, and co-balancing numbers, can be extracted from some generalized sequences of numbers. For some studies regarding different celebrated sequences of numbers, one can be referred, for example, to [21,22,23,24,25].

    From a numerical point of view, several types of Fibonacci and Lucas polynomials and their generalized and modified polynomials were utilized to find numerical solutions to some types of differential equations. For example, Abd-Elhameed and Youssri in the series of papers [26,27,28,29] solved some types of fractional differential equations utilizing Fibonacci and Lucas polynomials and some of their generalized polynomials. A Fibonacci wavelet method was utilized in [30] for solving the time-fractional bioheat transfer model. Certain modified Lucas polynomials were employed in [31] to treat some fractional optimal control problems. The authors in [32] used a certain generalized Lucas polynomial sequence to treat numerically the fractional pantograph differential equation.

    In [33], Abd-Elhameed and Zeyada have considered two sets of generalized Fibonacci numbers {Uc,dj}j0 and generalized Lucas numbers {Vc,dj}j0 that can be constructed respectively by means of the following recurrence relations:

    Uc,dj+2=cUc,dj+1+dUc,dj,j0,Uc,d0=0, Uc,d1=1, (1.1)

    and

    Vc,dj+2=cVc,dj+1+dVc,dj,j0,Vc,d0=2, Vc,d1=c, (1.2)

    and they developed some new identities involving the generalized Fibonacci and Lucas numbers. The famous identities of Sury and Marques were deduced as special cases, see [34,35]. Furthermore, Abd-Elhameed and Zeyada in [36] have considered another sequence of generalized numbers involving three parameters {Wc,d,rj}j0 that can be generated by the following recurrence relation:

    Wc,d,rj+2=rWc,d,rj+1+Wc,d,rj,j0,Wc,d,r0=drc,Wc,d,r1=c, (1.3)

    and they developed some other identities involving the generalized numbers Wc,d,rj.

    An an important class of generalized numbers that generalizes the three classes of the generalized Fibonacci and Lucas numbers constructed by means of the three recurrence relations (1.1)–(1.3) is the Horadam sequence of numbers {Gp,q,a,bi}i0 [37] that can constructed with the aid of the following recurrence relation:

    Gp,q,a,bi+2pGp,q,a,bi+1qGp,q,a,bi=0,Gp,q,a,b0=a,Gp,q,a,b1=b,i0, (1.4)

    where p,q,a,b are arbitrary integers.

    Horadam in [37] presented some basic properties of the sequence {Gp,q,a,bi}i0, while he derived the generating function of this sequence of numbers in [38]. Some convoluted formulas concerned with these numbers are derived in [39]. In addition, Melham in [40] derived some other identities concerned with the same sequence of numbers.

    This paper is concerned with deriving some new formulas concerned with the Horadam generalized sequence of numbers {Gp,q,a,bi}i0. The presence of four parameters in the sequence of numbers implies that several celebrated numbers such as the generalized Fibonacci, generalized Lucas, Fibonacci, Lucas, Pell, Pell-Lucas, Fermat, Fermat-Lucas, Jacobsthal, Jacobsthal-Lucas, balancing, and co-balancing numbers. can be considered special ones of our considered generalized numbers of four parameters [41]. This gives a motivation to consider and investigate the generalized sequence of numbers. Another motivation to consider the generalized numbers is that many identities concerned with them generalize some identities that exist in the literature.

    We can summarize the aims of this article in the following items.

    ● Developing a new explicit expression of these numbers.

    ● Deriving a recurrence relation that is satisfied between two certain generalized number sequences.

    ● Developing new identities between two generalized classes of numbers.

    ● Deducing some specific identities involving the special numbers namely, Fibonacci, Lucas, Pell, Pell-Lucas, Fermat, Fermat-Lucas, Jacobsthal, Jacobsthal-Lucas, balancing, and co-balancing numbers.

    The contents of the rest of the paper are structured as follows. Section 2 introduces an account of the Horadam sequence of generalized numbers that involves four parameters. Some of their fundamental properties are given. It is also shown in this section that some of the celebrated numbers can be considered special ones of them. In Section 3, two basic theorems concerned with the generalized sequence of numbers are stated and proved. In the first theorem, we give an explicit expression to these generalized numbers, while in the second theorem, a new recurrence relation concerned with two certain families of these numbers is given. Section 4 presents the main results of this paper. Some new identities are given in this respect. Moreover, some special identities are given from the new results in this section. Section 5 is devoted to presenting other identities between some generalized and specific classes of numbers. Finally, Section 6 displays the conclusion.

    This section is devoted to presenting some basic formulas of the generalized sequence of numbers {Gp,q,a,bi}i0.

    It is worthy to note here that the sequence of numbers {Gp,q,a,bi}i0 can be considered as a generalization of the three number sequences {Uc,di}i0,{Vc,di}i0 and {Wc,d,ri}i0 that generated respectively by the recurrence relations given in (1.1)–(1.3), for suitable choices of p,q,a and b.

    It is not difficult to write the Binet's form for Gp,q,a,bi. In fact, these numbers can be represented as

    Gp,q,a,bi=c1αi+c2βi,

    where c1 and c2 are constants to be determined, and α and β are the roots of the characteristic equation of (1.4), given by

    y2pyq=0,

    so, we have

    α=12(p+p2+4q),β=12(pp2+4q).

    It is not difficult to determine c1 and c2 to give

    c1=baβαβ,c2=aαβαβ,

    and this leads to the following Binet's form for Gp,q,a,bi

    Gp,q,a,bi=αi(baβ)+βi(aαb)αβ,

    that is

    Gp,q,a,bi=12i+1p2+4q×((p+p2+4q)i(2b+a(p+p2+4q))+(pp2+4q)i(2b+a(p+p2+4q))).

    This class of the generalized numbers {Gp,q,a,bi}i0 has the advantage that several generalized and specific classes of numbers can be deduced from it. In fact, by selecting suitable choices of the involved four parameters in (1.4), these celebrated numbers can be deduced. In Table 1, we display some of these numbers that can deduced as special cases from the generalized numbers {Gp,q,a,bi}i0. In every row of this table, we write the corresponding values of the four parameters a,b,p,q for each sequence accompanied by its corresponding recurrence relation.

    Table 1.  Some special numbers cases of the generalized numbers Gp,q,a,bn.
    Numbers p q a b Recurrence relation
    Generalized Fibonacci in (1.1) c d 0 1 Uc,dn+2cUc,dn+1dUc,dn=0
    Generalized Lucas in (1.2) c d 2 c Vc,dn+2cVc,dn+1dVc,dn=0
    Generalized numbers in (1.3) r 1 drc c Wc,d,rj+2rWc,d,rj+1Wc,d,rj=0
    Fibonacci 1 1 0 1 FnFn1Fn2=0
    Lucas 1 1 2 1 LnLn1Ln2=0
    Pell 2 1 0 1 Pn2Pn1Pn2=0
    Pell-Lucas 2 1 2 2 Qn2Qn1Qn2=0
    Fermat 3 -2 0 1 Fn3Fn1+2Fn2=0
    Fermat-Lucas 3 -2 2 3 fn3fn1+2fn2=0
    Jacobsthal 1 2 0 1 JnJn12Jn2=0
    Jacobsthal-Lucas 1 2 2 1 jnjn12jn2=0
    Balancing 6 -1 0 1 Bn6Bn1+Bn2=0
    Co-balancing 6 -1 2 6 bn6bn1+bn2=0

     | Show Table
    DownLoad: CSV

    It is worth mentioning that the generating function of the sequence of numbers {Gp,q,a,bi}i0 is established by Horadam [38] as:

    F(t)=a+t(bap)1ptqt2.

    This section is interested in developing two new basic formulas of the generalized numbers Gp,q,a,bi generated by means of the recurrence relation (1.4). In the first theorem, we give a new explicit expression for these numbers. The second theorem links between the two families of numbers sequences {Gp,q,a,bi}i0 and {Gp,q,c,di}i0.

    Theorem 3.1. The generalized numbers Gp,q,a,bi generated by the recurrence relation (1.4) can be explicitly expressed by the following formula:

    Gp,q,a,bi=i2n=0qnpi2n1(i2n+1)n1((i2n)b+nap)n!, i1, (3.1)

    where z represents the well-known floor function, and (ξ)n represents the Pochhammer symbol, that is: (ξ)n=Γ(ξ+n)Γ(ξ).

    Proof. First, assume that

    Fp,q,a,bi=i2n=0qnpi2n1(i2n+1)n1((i2n)b+nap)n!. (3.2)

    It is easy to see that: Fp,q,a,b0=a and Fp,q,a,b1=b, so to show that Fp,q,a,bi=Gp,q,a,bi, we need to show that it satisfies the same recurrence relation in (1.4). For this purpose, set

    Pp,q,a,bi=Fp,q,a,bi+2pFp,q,a,bi+1qFp,q,a,bi,

    and we will show the validity of the following identity:

    Pp,q,a,bi=0. (3.3)

    Due to (3.2), we can write

    Pp,q,a,bi=i2+1n=0Mn,i+2pi+12n=0Mn,i+1qi2n=0Mn,i, (3.4)

    where

    Mn,i=qnpi2n1(i2n+1)n1((i2n)b+nap)n!. (3.5)

    To show the validity of (3.3), we consider the following two cases.

    Case 1: For i=2j. In such case, Formula (3.4) leads to the following formula

    Pp,q,a,b2j=Mj+1,2j+2+jn=0(Mn,2j+2pMn,2j+1qMn,2j),

    that is can be written as

    Pp,q,a,b2j=aqj+1+jn=0p1+2j2nqn(p2(b(2+2j2n)+a(1+n)p)(2jn)!(2j2n+2)!(n1)!(2b(jn)+anp)q(2jn1)!(2j2n)!n!). (3.6)

    Now, to get a closed-form for the summation that appears in (3.6), we set

    Hn,j=jn=0p1+2j2nqn(p2(b(2+2j2n)+a(1+n)p)(2jn)!(2j2n+2)!(n1)!(2b(jn)+anp)q(2jn1)!(2j2n)!n!),

    and make use of the Zeilberger's algorithm through the Maple software, and in particular, the "sumrecursion command" [42] to show that Hn,j satisfies the following recurrence relation of order one:

    Hn,j+1qHn,j=0,Hn,0=aq,

    which can be easily solved to give

    Hn,j=aq1+j. (3.7)

    Relation (3.7) along with relation (3.6) leads to

    Pp,q,a,b2j=0. (3.8)

    Case 2: For i=2j+1. In such case, Formula (3.4) leads to the following formula

    Pp,q,a,b2j+1=j+1n=0(Mn,2j+3pMn,2j+2qMn,2j+1),

    that can be written explicitly as

    Pp,q,a,b2j+1=bp2jq+jn=0p2(1+jn)q1+n(p2(b+2bj2bn+anp)(2jn)!(1+2j2n)!n!(b(1+2j2n)+a(1+n)p)q(1+2jn)!(1+2j2n)!(1+n)!).

    Now, set

    Rn,j=jn=0p2(1+jn)q1+n(p2(b+2bj2bn+anp)(2jn)!(1+2j2n)!n!(b(1+2j2n)+a(1+n)p)q(1+2jn)!(1+2j2n)!(1+n)!).

    Making use of Zeilberger's algorithm again leads to the following recurrence relation:

    Rn,j+1=p2Rn,j,Rn,0=bq,

    that can be easily solved to give

    Rn,j=bp2jq,

    and accordingly,

    Pp,q,a,b2j+1=0. (3.9)

    The two Formulas (3.8) and (3.9) show the desired result of Theorem 3.1.

    Now, the following theorem is useful in the sequel. In this theorem, we will give a recurrence relation between the two classes of numbers {Gp,q,a,bi}i0 and {Gp,q,c,di}i0.

    Theorem 3.2. For q0 and a2q+abpb20, the following recurrence relation holds for every non-negative integer i:

    Gp,q,c,di+1=Gp,q,a,bi+(pq+bd+bcp+acqb2+abp+a2q)Gp,q,a,bi+1+(1q+bc+adb2+abp+a2q)Gp,q,a,bi+2. (3.10)

    Proof. To show the validity of the recurrence relation (3.10), we prove that

    Li=Gp,q,a,bi+MGp,q,a,bi+1+RGp,q,a,bi+2Gp,q,c,di+1=0, (3.11)

    where

    M=pq+bd+bcp+acqb2+abp+a2q,R=1q+bc+adb2+abp+a2q.

    We are going to prove that

    L2i=0,andL2i+1=0.

    The proofs of the two identities are similar, We will prove that L2i+1=0.

    In virtue of the explicit representation of Gp,q,a,bi in (3.1), we can write L2i+1 in the form

    L2i+1=im=0Sm,i+Mim=0ˉSm,i+Ri+1m=0Sm,i+1im=0Hm,i, (3.12)

    where

    Sm,i=qmp2i2m1(2i2m+1)m1(2(im)b+map)m!,ˉSm,i=qmp2i2m(2i2m+2)m1((2i2m+1)b+map)m!,Hm,i=qmp2i2m(2i2m+2)m1((2i2m+1)d+mcp)m!.

    Relation (3.12) can be written alternatively as

    L2i+1=RSi+1,i+1+im=0Tm,i, (3.13)

    and

    Tm,i=Sm,i+MˉSm,i+RSm,i+1Hm,i.

    It can be shown that

    im=0Tm,i=aqi+1(adbca2q+abpb21q)=RSi+1,i+1,

    and accordingly

    L2i+1=0.

    Theorem 3.2 is now proved.

    This section is confined to presenting new identities involving the generalized numbers Gp,q,a,bi. Some identities involving the generalized Fibonacci, generalized Lucas, Fibonacci, Lucas, Pell, Pell-Lucas, Fermat, Fermat-Lucas, Jacobsthal, Jacobsthal-Lucas, balancing, and co-balancing numbers are also deduced as special cases.

    Theorem 4.1. Let k be a non-negative integer, and let xR=R{0}. For bd+acq+bcp0, one has

    xk+1Gp,q,a,bk+1=a+1bd+acq+bcpki=0xi((adbc+x(bd+acq+bcp))Gp,q,a,bi+1+(b2a2qabp) Gp,q,c,di). (4.1)

    Proof. We will prove the result by induction. For k=0, it is easy to see that the left-hand side equals the right-hand side which is equal to (bx). Now assume the validity of (4.1), and then to complete the proof, we have to prove the following identity:

    xk+2Gp,q,a,bk+2=a+1bd+acq+bcpk+1i=0xi((adbc+x(bd+acq+bcp))Gp,q,a,bi+1+(b2a2qabp)Gp,q,c,di). (4.2)

    It is clear that each side of relation (4.2) is a polynomial of degree (k+2). Now, let

    M(x)=a+1bd+acq+bcpk+1i=0xi((adbc+x(bd+acq+bcp))Gp,q,a,bi+1+(b2a2qabp)Gp,q,c,di).

    Now to show (4.2), it suffices to show the validity of the following formula

    M(x)=xk+2Gp,q,a,bk+2.

    The polynomial M(x) can be written in the form

    M(x)=a+1bd+acq+bcp×ki=0xi((adbc+x(bd+acq+bcp))Gp,q,a,bi+1+(b2a2qabp)Gp,q,c,di)+1bd+bcp+acqxk+1((b(c+dxcpx)+a(d+cqx))Gp,q,a,bk+1+(b2abpa2q)Gp,q,c,dk+1). (4.3)

    Making use of the inductive step leads to

    M(x)=xk+1Gp,q,a,bk+1+1bd+bcp+acqxk+1×((b(c+dxcpx)+a(d+cqx))Gp,q,a,bk+2+(b2abpa2q)Gp,q,c,dk+1). (4.4)

    If we insert the mixed recurrence relation (3.10) written in the form

    Gp,q,c,dk+1=Gp,q,a,bk+(pq+bd+bcp+acqb2+abp+a2q)Gp,q,a,bk+1+(1q+bc+adb2+abp+a2q)Gp,q,a,bk+2, (4.5)

    into relation (4.4), then after collecting the similar terms, the following identity can be obtained:

    M(x)=xk+1(b2+aq(a+cqx)+b(ap+(d+cp)qx)q(bd+bcp+acq)Gp,q,a,bk+2+p(b2abpa2q)q(bd+bcp+acq)Gp,q,a,bk+1b2abpa2qbd+bcp+acqGp,q,a,bk). (4.6)

    In virtue of the recurrence relation (1.4), and doing some simplifications enable one to reduce M(x) in the form

    M(x)=xk+2Gp,q,a,bk+2,

    and hence the following formula is obtained

    xk+1Gp,q,a,bk+1=a+1bd+acq+bcpki=0xi((adbc+x(bd+acq+bcp))Gp,q,a,bi+1+(b2a2qabp)Gp,q,c,di).

    This completes the proof of Theorem 4.1.

    Several special formulas involving some generalized Fibonacci and generalized Lucas numbers can be deduced as special cases of Theorem 4.1. The following corollaries display some identities between the generalized numbers of four parameters and the generalized Fibonacci and generalized Lucas numbers that are generated respectively by the two recurrence relations in (1.1) and (1.2).

    Corollary 4.1. Let k be a non-negative integer, and xR. For cpd, one has

    xk+1Up,qk+1=1d+cpki=0xi(Gp,q,c,di+(c+(d+cp)x)Up,qi+1). (4.7)

    Proof. The substitution by a=0,b=1 in Identity (4.1) yields relation (4.7).

    Corollary 4.2. Let k be a non-negative integer, and xR. Then for b0, one has

    xk+1Gp,q,a,bk+1=a1bki=0xi((b2abpa2q)Up,qi+(abx)Up,qi+1). (4.8)

    Proof. The substitution by c=0,d=1 in Identity (4.1) yields relation (4.8).

    Corollary 4.3. Let k be a non-negative integer, and xR. Then for c(p2+2q)dp, one has

    xk+1Vp,qk+1=2+1dp+c(p2+2q)×ki=0xi((p24q)Gp,q,c,di+(2dcp+(dp+cp2+2cq)x)Vp,qi+1). (4.9)

    Proof. The substitution by a=2,b=p in Identity (4.1) yields relation (4.9).

    Corollary 4.4. Let k be a non-negative integer, and xR. Then for bp+2aq0, one has

    xk+1Gp,q,a,bk+1=a+1bp+2aq×ki=0xi((b2abpa2q)Vp,qi+(2b+ap+(bp+2aq)x)Gp,q,a,bi+1). (4.10)

    Proof. The substitution by c=2,d=p in Identity (4.1) yields relation (4.10).

    Taking into consideration the special number sequences mentioned in Table 1, the following corollaries provide some of the special formulas.

    Corollary 4.5. For the generalized classes of Fibonacci and Lucas numbers that generated respectively by the two recurrence relations (1.1) and (1.2), the following two identities hold if k is a non-negative integer, xR, and p0

    xk+1Up,qk+1=1pki=0xi((2+px)Up,qi+1+Vp,qi), (4.11)
    xk+1Va,bk+1=21pki=0xi((2px)Vp,qi+1+(p24q)Up,qi). (4.12)

    Proof. Identity (4.11) is a direct consequence of Identity (4.7) for the special case corresponding to c=2 and d=p, while Identity (4.12) is a direct consequence of Identity (4.10) for the special case corresponding to c=0 and d=1.

    Remark 4.1. The Identity (4.11) coincides with that obtained in [33].

    Remark 4.2. Since the Fibonacci, Pell, Fermat, Jacobsthal and balancing numbers are special ones of the generalized Fibonacci numbers Up,qk, and the Lucas, Pell-Lucas, Fermat-Lucas, Jacobsthal-Lucas and co-balancing numbers are special ones of the generalized Lucas numbers Vp,qk, so the two Identities (4.11) and (4.12) lead to some interesting identities concerning these celebrated numbers. The following corollaries display these identities.

    Corollary 4.6. For Fibonacci and Lucas numbers, the following two identities hold for every non-negative integer k, and every xR:

    xk+1Fk+1=ki=0xi(Li+(2+x)F1+i), (4.13)
    xk+1Lk+1=2ki=0xi(5Fi+(2x)L1+i). (4.14)

    Proof. If we set a=1 and b=1 in (4.11) and (4.12) respectively, the two Identities (4.13) and (4.14) can be obtained.

    Corollary 4.7. For Pell and Pell-Lucas numbers, the following two identities hold for every non-negative integer k, and every xR:

    xk+1Pk+1=12ki=0xi(Qi+(2+2x)Pi+1), (4.15)
    xk+1Qk+1=212ki=0xi(8Pi+(22x)Qi+1). (4.16)

    Proof. If we set a=2 and b=1 in (4.11) and (4.12) respectively, the two Identities (4.15) and (4.16) can be obtained.

    Corollary 4.8. For Fermat and Fermat-Lucas numbers, the following two identities hold for every non-negative integer k, and every xR:

    xk+1Fk+1=13ki=0xi((2+3x)Fi+1+fi), (4.17)
    xk+1fk+1=213ki=0xi((23x)fi+1Fi). (4.18)

    Proof. If we set a=3 and b=2 in (4.11) and (4.12) respectively, the two Identities (4.17) and (4.17) can be obtained.

    Corollary 4.9. For Jacobsthal and Jacobsthal-Lucas numbers, the following two identities hold for every non-negative integer k, and every xR:

    xk+1Jk+1=ki=0xi((2+x)Ji+1+ji), (4.19)
    xk+1jk+1=2ki=0xi((2x)ji+19Ji). (4.20)

    Proof. If we set a=1 and b=2 in (4.11) and (4.12) respectively, the two Identities (4.19) and (4.19) can be obtained.

    Corollary 4.10. For balancing and co-balancing numbers, the following two identities hold for every non-negative integer k, and every xR:

    xk+1Bk+1=16ki=0xi((2+6x)Bi+1+bi), (4.21)
    xk+1bk=216ki=0xi((26x)bi+132Bi). (4.22)

    Proof. If we set a=6 and b=1 in (4.11) and (4.12) respectively, the two Identities (4.21) and (4.21) can be obtained.

    This section concentrates on introducing some other identities concerned with the Horadam generalized numbers Gp,q,a,bk and some of their special numbers.

    Theorem 5.1. For every non-negative integer k, every xR, and for bcp+acqbd, one has

    (k+1)xk+1Gp,q,a,bk+1=ki=0xi(((bc+ad)ibd+bcp+acq+(i+1)x)G,p,q,a,bi+1+i(b2abpa2q)bd+bcp+acqGp,q,c,di). (5.1)

    Proof. If we differentiate both sides of (4.1) with respect to x, then Identity (5.1) can be obtained.

    Taking into consideration the special numbers of the generalized numbers Gp,q,a,bi+1 that can be deduced by choosing the four parameters p,q,a and b suitably, then some identities can be deduced are direct consequences of Theorem 5.1. The following theorem exhibits these identities.

    Corollary 5.1. For the generalized Fibonacci and generalized Lucas numbers, the following two identities hold for every non-negative integer k, every xR, and for p0:

    (k+1)xk+1Up,qk+1=ki=0xi((2ip+(1+i)x)Up,qi+1+ipVp,qi), (5.2)
    (k+1)xk+1Vp,qk+1=ki=0xi(i(p2+4q)pUp,qi+(2ip+(1+i)x)Vp,qi+1). (5.3)

    Corollary 5.2. For Fibonacci and Lucas numbers, the following two identities hold for every non-negative integer k, every xR:

    (k+1)xk+1Fk+1=ki=0xi((2i+(1+i)x)Fi+1+iLi), (5.4)
    (k+1)xk+1Lk+1=ki=0xi((2i+(i+1)x)L1+i+5iFi). (5.5)

    Corollary 5.3. For Pell and Pell-Lucas numbers, the following two identities hold for every non-negative integer k, every xR:

    (k+1)xk+1Pk+1=ki=0xi((i+(1+i)x)Pi+1+12iQi), (5.6)
    (k+1)xk+1Qk+1=ki=0xi((i+(1+i)x)Qi+1+4iPi). (5.7)

    Corollary 5.4. For Fermat and Fermat-Lucas numbers, the following two identities hold for every non-negative integer k, every xR:

    (k+1)xk+1Fk+1=ki=0xi((2i3+(i+1)x)Fi+1+13ifi), (5.8)
    (k+1)xk+1fk+1=ki=0xi((2i3+(i+1)x)fi+1+13iFi). (5.9)

    Corollary 5.5. For Jacobsthal and Jacobsthal-Lucas numbers, the following two identities hold for every non-negative integer k, every xR:

    (k+1)xk+1Jk+1=ki=0xi(iji+(2i+(i+1)x)Ji+1), (5.10)
    (k+1)xk+1jk+1=ki=0xi((2i+(i+1)x)ji+1+9iJi). (5.11)

    Corollary 5.6. For balancing and co-balancing numbers, the following two identities hold for every non-negative integer k, every xR:

    (k+1)xk+1Bk+1=ki=0xi((i3+(i+1)x)Bi+1+16ibi), (5.12)
    (k+1)xk+1bi=ki=0xi((i3+(i+1)x)bi+1+163iBi). (5.13)

    Remark 5.1. All the above identities in Sections 4 and 5 can be generalized if both sides of Eq (4.1) is differentiated rtimes. The following theorem is a generalization of Theorem 4.1.

    Theorem 5.2. For all non-negative integer k,r, every xR, and for bcp+acqbd, the following identity is valid:

    (kr+2)r xk+1Gp,q,a,bk+1=ki=0xi(((bc+ad)(1+ir)bd+bcp+acq+(1+i)x)(2+ir)r1Gp,q,a,bi+1+(b2abpa2q)(1+ir)rbd+bcp+acqGp,q,c,di). (5.14)

    Proof. Differentiating both sides of (4.1) with respect to x yields the following identity:

    (kr+2)rxkr+1Up,q,a,bk+1=ki=0(xirξ(i+1r)rGp,q,a,bi+1+xir+1(ir+2)rGp,q,a,bi+1+γxir(ir+1)rVp,q,c,di). (5.15)

    with

    ξ=adbcbd+acq+bcp,η=b2a2qabpbd+bcp+acq,

    that can be written after some simplifications in the form

    (kr+2)r xk+1Gp,q,a,bk+1=ki=0xi(((bc+ad)(1+ir)bd+bcp+acq+(1+i)x)(ir+2)r1Gp,q,a,bi+1+(b2abpa2q)(1+ir)rbd+bcp+acqGp,q,c,di).

    In the following, we write the generalizations of Corollaries 11–16 which are special cases of the general result in Theorem 5.2. They can be deduced by selecting the six parameters p,q,a,b,c and d that appears in Identity (5.14).

    Corollary 5.7. For all non-negative integer k,r, every xR, and for p0, the following two identities are valid:

    (kr+2)rxk+1Up,qk+1=ki=0xi((2(1+ir)p+(1+i)x)(2+ir)r1Up,qi+1+(1+ir)rpVp,qi), (5.16)
    (kr+2)rxk+1Vp,qk+1=ki=0xi(((bc+ad)(1+ir)bd+bcp+acq+(1+i)x)(2+ir)r1Vp,qi+1+(b2abpa2q)(1+ir)rbd+bcp+acqUp,qi). (5.17)

    Corollary 5.8. For Fibonacci and Lucas numbers, the following two identities hold for all non-negative integers k and r, every xR:

    (kr+2)rxk+1Fk+1=ki=0xi((2(1+ir)+(1+i)x)(2+ir)r1Fi+1+(1+ir)rLi), (5.18)
    (kr+2)rxk+1Lk+1=ki=0xi(5(1+ir)rFi+(2(1+ir) (5.19)
    +(1+i)x)(2+ir)r1 L1+i). (5.20)

    Corollary 5.9. For Pell and Pell-Lucas numbers, the following two identities hold for all non-negative integers k and r, every xR:

    xk+1(2+kr)rPk+1=ki=0xi((1i+r+(1+i)x)(2+ir)r1Pi+1+12(1+ir)rQi,), (5.21)
    (kr+2)rxk+1Qk+1=ki=0xi((1i+r+(1+i)x)(2+ir)r1Qi+1+4(1+ir)rPi). (5.22)

    Corollary 5.10. For Fermat and Fermat-Lucas numbers, the following two identities hold for all non-negative integers k and r, every xR:

    (kr+2)rxk+1Fk+1=ki=0xi((13(2)(1+ir)+(1+i)x)(2+ir)r1Fi+1+13(1+ir)rfi)), (5.23)
    (kr+2)rxk+1fk+1=ki=0xi((23(1+ir)+(1+i)x)(2+ir)r1fi+1) (5.24)
    +13(1+ir)rFi). (5.25)

    Corollary 5.11. For Jacobsthal and Jacobsthal-Lucas numbers, the following two identities hold for all non-negative integers k and r, every xR:

    (kr+2)rxk+1Jk+1=ki=0xi((2(1+ir)+(1+i)x)(2+ir)r1Ji+1+(1+ir)rji), (5.26)
    (kr+2)rxk+1jk+1=ki=0xi((2(1+ir)+(1+i)x)(2+ir)r1ji+1+9(1+ir)rJi). (5.27)

    Corollary 5.12. For balancing and co-balancing numbers, the following two identities hold for all non-negative integers k and r, every xR:

    (kr+2)r xk+1Bk+1=ki=0xi((13(1i+r)+(1+i)x)(2+ir)r1Bi+1+16(1+ir)rbi), (5.28)
    (kr+2)rxk+1bk+1=ki=0xi((13(1i+r)+(1+i)x)(2+ir)r1bi+1+163(1+ir)rBi). (5.29)

    In this paper, we have investigated Horadam generalized numbers involving four parameters that generalize some generalized and specific types of Fibonacci and Lucas numbers. A new identity involving six parameters was derived. Some of the interesting identities involving generalized and specific numbers such as Fibonacci, Lucas, Pell, Pell-Lucas, Jacobsthal, Jacobsthal-Lucas, balancing, and co-balancing numbers were extracted as special cases. Some well-known identities in the literature can be extracted from our identities as special cases by selecting suitably the involved parameters. In future work, we aim to perform some other studies regarding these generalized numbers. In addition, we aim to study other types of generalized Fibonacci and Lucas numbers.

    The authors would like to thank the Deanship of Scientific Research at Umm Al-Qura University for supporting this work by Grant Code: 22UQU4331287DSR03.

    The authors declare that they have no competing interests.



    [1] T. Koshy, Fibonacci and Lucas numbers with applications, John Wiley & Sons, 2011.
    [2] U. K. Dutta, P. K. Ray, On the finite reciprocal sums of Fibonacci and Lucas polynomials, AIMS Mathematics, 4 (2019), 1569–1581. https://doi.org/10.3934/math.2019.6.1569 doi: 10.3934/math.2019.6.1569
    [3] W. C. Chu, N. N. Li, Power sums of Fibonacci and Lucas numbers, Quaest. Math., 34 (2011), 75–83. https://doi.org/10.2989/16073606.2011.570298 doi: 10.2989/16073606.2011.570298
    [4] R. Battaloglu, Y. Simsek, On new formulas of Fibonacci and Lucas numbers involving golden ratio associated with atomic structure in chemistry, Symmetry, 13 (2021), 1334. https://doi.org/10.3390/sym13081334 doi: 10.3390/sym13081334
    [5] V. E. Hoggatt, M. Bicknell, Roots of Fibonacci polynomials, Fibonacci Quart., 11 (1973), 271–274.
    [6] Y. K. Ma, W. P. Zhang, Some identities involving Fibonacci polynomials and Fibonacci numbers, Mathematics, 6 (2018), 334. https://doi.org/10.3390/math6120334 doi: 10.3390/math6120334
    [7] P. Trojovskỳ, Fibonacci numbers with a prescribed block of digits, Mathematics, 8 (2020), 639. https://doi.org/10.3390/math8040639 doi: 10.3390/math8040639
    [8] W. M. Abd-Elhameed, Y. H. Youssri, N. El-Sissi, M. Sadek, New hypergeometric connection formulae between Fibonacci and Chebyshev polynomials, Ramanujan J., 42 (2017), 347–361. https://doi.org/10.1007/s11139-015-9712-x doi: 10.1007/s11139-015-9712-x
    [9] W. M. Abd-Elhameed, N. A. Zeyada, New formulas including convolution, connection and radicals formulas of k-Fibonacci and k-Lucas polynomials, Indian J. Pure Appl. Math., 2022. https://doi.org/10.1007/s13226-021-00214-5
    [10] J. B. Muskat, Generalized Fibonacci and Lucas sequences and rootfinding methods, Math. Comp., 61 (1993), 365–372. https://doi.org/10.1090/S0025-5718-1993-1192974-3 doi: 10.1090/S0025-5718-1993-1192974-3
    [11] P. Trojovskỳ, On terms of generalized Fibonacci sequences which are powers of their indexes, Mathematics, 7 (2019), 700. https://doi.org/10.3390/math7080700 doi: 10.3390/math7080700
    [12] E. Özkan, İ Altun, A. Göçer, On relationship among a new family of k-Fibonacci, k-Lucas numbers, Fibonacci and Lucas numbers, Chiang Mai J. Sci., 44 (2017), 1744–1750.
    [13] H. H. Gulec, N. Taskara, K. Uslu, A new approach to generalized Fibonacci and Lucas numbers with binomial coefficients, Appl. Math. Comput., 220 (2013), 482–486. https://doi.org/10.1016/j.amc.2013.05.043 doi: 10.1016/j.amc.2013.05.043
    [14] Y. Yazlik, N. Taskara, A note on generalized-Horadam sequence, Comput. Math. Appl., 63 (2012), 36–41. https://doi.org/10.1016/j.camwa.2011.10.055 doi: 10.1016/j.camwa.2011.10.055
    [15] P. K. Ray, Identities concerning k-balancing and k-Lucas-balancing numbers of arithmetic indexes, AIMS Mathematics, 4 (2019), 308–315. https://doi.org/10.3934/math.2018.2.308 doi: 10.3934/math.2018.2.308
    [16] O. Yayenie, A note on generalized Fibonacci sequences, Appl. Math. Comput., 217 (2011), 5603–5611. https://doi.org/10.1016/j.amc.2010.12.038 doi: 10.1016/j.amc.2010.12.038
    [17] A. P. Chaves, P. Trojovskỳ, A quadratic Diophantine equation involving generalized Fibonacci numbers, Mathematics, 8 (2020), 1010. https://doi.org/10.3390/math8061010 doi: 10.3390/math8061010
    [18] D. Andrica, O. Bagdasar, Pseudoprimality related to the generalized Lucas sequences, Math. Comput. Simulat., 2021. (In press). https://doi.org/10.1016/j.matcom.2021.03.003
    [19] D. Andrica, O. Bagdasar, On some new arithmetic properties of the generalized Lucas sequences, Mediterr. J. Math., 18 (2021), 47. https://doi.org/10.1007/s00009-020-01653-w doi: 10.1007/s00009-020-01653-w
    [20] U. Bednarz, M. Wołowiec-Musiał, Distance Fibonacci polynomials, Symmetry, 12 (2020), 1540. https://doi.org/10.3390/sym12091540 doi: 10.3390/sym12091540
    [21] Y. Choo, On the reciprocal sums of products of balancing and Lucas-balancing numbers, Mathematics, 9 (2021), 350. https://doi.org/10.3390/math9040350 doi: 10.3390/math9040350
    [22] S. Çelik, I. Durukan, E. Özkan, New recurrences on Pell numbers, Pell-Lucas numbers, Jacobsthal numbers, and Jacobsthal-Lucas numbers, Chaos Soliton. Fract., 150 (2021), 111173. https://doi.org/10.1016/j.chaos.2021.111173 doi: 10.1016/j.chaos.2021.111173
    [23] P. Trojovskỳ, S. Hubálovskỳ, Some Diophantine problems related to k-Fibonacci numbers, Mathematics, 8 (2020), 1047. https://doi.org/10.3390/math8071047 doi: 10.3390/math8071047
    [24] E. Tchammou, A. Togbé, On some Diophantine equations involving balancing numbers, Arch. Math., 57 (2021), 113–130. https://doi.org/10.5817/AM2021-2-113 doi: 10.5817/AM2021-2-113
    [25] J. J. Bravo, J. L. Herrera, F. Luca, On a generalization of the Pell sequence, Math. Bohem., 146 (2021), 199–213. https://doi.org/10.21136/MB.2020.0098-19 doi: 10.21136/MB.2020.0098-19
    [26] W. M. Abd-Elhameed, Y. H. Youssri, A novel operational matrix of Caputo fractional derivatives of Fibonacci polynomials: Spectral solutions of fractional differential equations, Entropy, 18 (2016), 345. https://doi.org/10.3390/e18100345 doi: 10.3390/e18100345
    [27] W. M. Abd-Elhameed, Y. H. Youssri, Spectral tau algorithm for certain coupled system of fractional differential equations via generalized Fibonacci polynomial sequence, Iran. J. Sci. Technol. Trans. Sci., 43 (2019), 543–554. https://doi.org/10.1007/s40995-017-0420-9 doi: 10.1007/s40995-017-0420-9
    [28] W. M. Abd-Elhameed, Y. H Youssri, Generalized Lucas polynomial sequence approach for fractional differential equations, Nonlinear Dyn., 89 (2017), 1341–1355. https://doi.org/10.1007/s11071-017-3519-9 doi: 10.1007/s11071-017-3519-9
    [29] W. M. Abd-Elhameed, Y. H. Youssri, Spectral solutions for fractional differential equations via a novel Lucas operational matrix of fractional derivatives, Rom. J. Phys., 61 (2016), 795–813.
    [30] M. Irfan, F. A. Shah, Fibonacci wavelet method for solving the time-fractional bioheat transfer model, Optik, 241 (2021), 167084. https://doi.org/10.1016/j.ijleo.2021.167084 doi: 10.1016/j.ijleo.2021.167084
    [31] B. P. Moghaddam, A. Dabiri, A. M. Lopes, J. A. T. Machado, Numerical solution of mixed-type fractional functional differential equations using modified Lucas polynomials, Comput. Appl. Math., 38 (2019), 46. https://doi.org/10.1007/s40314-019-0813-9 doi: 10.1007/s40314-019-0813-9
    [32] Y. H. Youssri, W. M. Abd-Elhameed, A. S. Mohamed, S. M. Sayed, Generalized Lucas polynomial sequence treatment of fractional pantograph differential equation, Int. J. Appl. Comput. Math., 7 (2021), 27. https://doi.org/10.1007/s40819-021-00958-y doi: 10.1007/s40819-021-00958-y
    [33] W. M. Abd-Elhameed, N. A. Zeyada, New identities involving generalized Fibonacci and generalized Lucas numbers, Ind. J. Pure Appl. Math., 49 (2018), 527–537. https://doi.org/10.1007/s13226-018-0282-7 doi: 10.1007/s13226-018-0282-7
    [34] B. Sury, A polynomial parent to a Fibonacci–Lucas relation, Am. Math. Mon., 121 (2014), 236. https://doi.org/10.4169/amer.math.monthly.121.03.236 doi: 10.4169/amer.math.monthly.121.03.236
    [35] D. Marques, A new Fibonacci–Lucas relation, Am. Math. Mon., 122 (2015), 683.
    [36] W. M. Abd-Elhameed, N. A. Zeyada, A generalization of generalized Fibonacci and generalized Pell numbers, Int. J. Math. Edu. Sci. Technol., 48 (2017), 102–107. https://doi.org/10.1080/0020739X.2016.1170900 doi: 10.1080/0020739X.2016.1170900
    [37] A. F. Horadam, Basic properties of a certain generalized sequence of numbers, Fibonacci Quart., 3 (1965), 161–176.
    [38] A. F. Horadam, Generating functions for powers of a certain generalised sequence of numbers, Duke Math. J., 32 (1965), 437–446. https://doi.org/ 10.1215/S0012-7094-65-03244-8 doi: 10.1215/S0012-7094-65-03244-8
    [39] H. Feng, Z. Z. Zhang, Computational formulas for convoluted generalized Fibonacci and Lucas numbers, Fibonacci Quart., 41 (2003), 144–151.
    [40] R. Melham, Generalizations of some identities of Long, Fibonacci Quart., 37 (1999), 106–110.
    [41] A. F. Horadam, Associated sequences of general order, Fibonacci Quart., 31 (1993), 166–172.
    [42] W. Koepf, Hypergeometric summation, an algorithmic approach to summation and special function identities, 2 Eds., Springer Universitext Series, 2014.
  • This article has been cited by:

    1. Waleed Mohamed Abd-Elhameed, Amr Kamel Amin, New Formulas and Connections Involving Euler Polynomials, 2022, 11, 2075-1680, 743, 10.3390/axioms11120743
    2. Waleed Mohamed Abd-Elhameed, Andreas N. Philippou, Nasr Anwer Zeyada, Novel Results for Two Generalized Classes of Fibonacci and Lucas Polynomials and Their Uses in the Reduction of Some Radicals, 2022, 10, 2227-7390, 2342, 10.3390/math10132342
    3. Elahe Mehraban, T. Aaron Gulliver, Salah Mahmoud Boulaaras, Kamyar Hosseini, Evren Hincal, New sequences from the generalized Pell pnumbers and mersenne numbers and their application in cryptography, 2024, 9, 2473-6988, 13537, 10.3934/math.2024660
    4. Engin Özkan, Mine Uysal, d-Gaussian Pell polynomials and their matrix representation, 2023, 15, 1793-8309, 10.1142/S1793830922501385
    5. Man Chen, Huaifeng Chen, On ideal matrices whose entries are the generalized kHoradam numbers, 2025, 10, 2473-6988, 1981, 10.3934/math.2025093
    6. Waleed Mohamed Abd-Elhameed, Omar Mazen Alqubori, Abdulrahim A. Alluhaybi, Amr Kamel Amin, Novel Expressions for Certain Generalized Leonardo Polynomials and Their Associated Numbers, 2025, 14, 2075-1680, 286, 10.3390/axioms14040286
  • Reader Comments
  • © 2022 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(2283) PDF downloads(116) Cited by(6)

Figures and Tables

Tables(1)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog