ON SOME IDENTITIES AND GENERATING FUNCTIONS FOR K-PELL

SEQUENCES AND CHEBYSHEV POLYNOMIALS

ALI BOUSSAYOUD AND SOUHILA BOUGHABA

Abstract. In this paper, we introduce a new operator in order to derive some properties
of homogeneous symmetric functions. By making use of the proposed operator, we give
some new generating functions for k-Fibonacci numbers, k-Pell numbers and product of
sequences and Chebyshev polynomials of second kind.

1. Introduction and Notations

There are a lot of integer sequences such as Fibonacci, Pell, Lucas, etc. Pell and
Pell-Lucas numbers are used by scientists for basic theories and their applications. For
interest application of these numbers in science and nature [26], one can see [20, 21, 15,
23]. For instance, in science, authors gave sums of the generalized Pell numbers could
be derived directly using a new matrix representation [28]. In [19], Horadam showed
that some properties involving Pell numbers and gave the formula
Pn+1 Pn−1 − Pn2 = (−1)n ,
for the Pell numbers. Also Ercolano [18], found the matrix A for generating the Pell
sequence as follows  
2 1
A= .
1 0
In [21], Horadam and Mahon obtained Simpson formula for the Pell-Lucas numbers
as follows
Qn+1 Qn−1 − Q2n = 8(−1)n+1 .
For the rest of this paper, for n ≥ 2 the well known Pell ( Pn )n≥2 and Pell-Lucas
numbers ( Qn )n≥2 are defined by
Pn = 2Pn−1 + Pn−2 and Qn = 2Qn−1 + Qn−2 ,
with initial conditions given by P0 = 0, P1 = 1 and Q0 = Q1 = 2, respectively.
In [1, 3], Horadam gave some equations related to Pell numbers and generating
functions for powers of a certain generalized sequences of numbers. Falcon, in [25],
introduced the k-Lucas sequences by using a special sequence of squares of k-Fibonacci
numbers. Recently, Catarino and Vasco have considered the k-Pell numbers, k-Pell
Date: 26 December 2018.
1991 Mathematics Subject Classification. 05E05; 11B39.
Key words and phrases. Generating function; k-Fibonacci numbers; k-Pell numbers..

1
2 ALI BOUSSAYOUD AND SOUHILA BOUGHABA

Lucas numbers and have presented some properties involving these number sequences
[16, 17].
In this contribution, we shall define a new useful operator denoted by δkp1 p2 for which
we can formulate, extend and prove new results based on our previous ones [6, 7, 12], in
order to determine generating functions of the product of k-Fibonacci numbers, k-Pell
numbers, and Chebyshev polynomials of second kind.
In order to render the work self-contained we give the necessary preliminaries. We
recall some definitions and results.
Definition 1.1. [10] Let B = {b1 , b2 , ...} and P = { p1 , p2 , ...}be any two alphabets. We define
Sn ( B − P) by the following form
Π peP (1 − pt) ∞
(1.1) = ∑ Sn ( B − P ) t n ,
ΠbeB (1 − bt) n =0
with the condition Sn ( B − P) = 0 for n < 0.
Equation (1.1) can be rewritten in the following form
∞ ∞ ∞
! !
∑ Sn ( B − P ) t n = ∑ Sn ( B ) t n × ∑ Sn (− P)tn ,
n =0 n =0 n =0

where
n
(1.2) Sn ( B − P ) = ∑ Sn− j (− P)Sj ( B).
j =0

We know that the polynomial whose roots are P is written as

n
Sn ( x − P ) = ∑ Sn− j (− P)xn , with card( P) = n.
j =0

On the other hand, if B has cardinality equal to 1, i.e., B = { x } , then (1.1) can be
rewritten as follows [12]:

∞
∏ (1 − pt)
p∈ P Sn ( x − P ) n
∑ Sn ( x − P ) t n
=
(1 − xt)
= 1 + · · · + S n −1 ( x − P ) t n −1 +
(1 − xt)
t ,
n =0

where Sn+k ( x − P) = x k Sn ( x − P) for all k ≥ 0.

The summation is actually limited to a finite number of terms since S−k (·) = 0 for
all k > 0. In particular, we have

∏ (x − p) = Sn (x − P) = S0 (− P)xn + S1 (− P)xn −1 + S2 (− P)xn −2 + · · · ,

p∈ P

where Sk (− B) are the coefficients of the polynomials Sn ( x − P) for 0 ≤ k ≤ n. These

coefficients are zero for k > n.
For example, if all p ∈ P are equal, i.e., P = np, then we have Sn ( x − np) = ( x − p)n .
 K-PELL SEQUENCES AND CHEBYCHEV POLYNOMIALS 3

 
 
By choosing p = 1, i.e., P = 1, 1, ...1 , we obtain
| {z }
n
n+k−1
   
k n
(1.3) Sk (−n) = (−1) and Sk (n) = .
k k
By combining (1.2) and (1.3), we obtain the following expression
     
n n n n
Sn ( B − nx ) = Sn ( B) − S n −1 ( B ) x + 2
Sn−2 ( B) x − · · · + (−1) xn .
1 2 n
Definition 1.2. [9] Given a function f on Rn , the divided difference operator is defined as
follows
f ( p1 , · · · , pi , pi+1 , · · · pn ) − f ( p1 , · · · pi−1 , pi+1, pi , pi+2 · · · pn )
∂ p i p i +1 ( f ) = .
p i − p i +1
Definition 1.3. The symmetrizing operator δek1 e2 is defined by
p1k g( p1 ) − p2k g( p2 )
(1.5) δkp1 p2 ( g) = for all k ∈ N.
p1 − p2
Proposition 1.4. [11] Let P = { p1 , p2 } an alphabet, we define the operator δkp1 p2 as follows
δkp1 p2 g( p1 ) = Sk−1 ( p1 + p2 ) g( p1 ) + p2k ∂ p1 p2 g ( p1 ), for all k ∈ N.
Proposition 1.5. [6] The relations
1) Fk,−n = (−1)n+1 Fk,n ,
2) Pk,−n = (−1)n+1 Pk,n
hold for all n ≥ 0.

2. The k-Pell Numbers and Properties

The k-Pell numbers have been defined in [16] for any number k as follows.
Definition 2.1. [16] For any positive real number k, the k-Pell numbers, say { Pk,n }n∈N is
defined recurrently by
(2.1) Pk,n+1 = 2Pk,n + kPk,n−1 for n ≥ 1,
with initial conditions Pk,0 = 1; Pk,1 = 1.
• If k = 1, the classical Pell numbers is obtained:
P0 = 0, P1 = 1, and Pn+1 = 2Pn + Pn−1 for n ≥ 1 :
{ Pn }n∈N = {0, 1, 2, 5, 8, 21, ...}
The well-known Binet’s formula in the Pell numbers theory [17] allows us to express
the k-Pell number in function of the roots r1 and r2 of the characteristic equation, asso-
ciated to the recurrence relation (2.1):
(2.2) r2 = 2r + k.

Online Journal of Analytic Combinatorics, Issue 14 (2019), #03

4 ALI BOUSSAYOUD AND SOUHILA BOUGHABA

Proposition 2.2. (Binet’s formula) The nth k-Pell number is given by

r1n − r2n
Pk,n = ,
r1 − r2

where r1 , r2 are the roots of the characteristic equation (2.2) and r1 > r2 .
√
Proof.
√ The roots of the characteristic equation (2.2) are r1 = 1 + 1 + k and r2 = 1 −
1 + k.
Note that, since k > 0, the
r2 < 0 < r1 and |r2 | < |r1 | ,
r1 + r2 = 2√and r1 .r2 = −k,
r1 − r2 = 2 1 + k. 

If σ denotes the positive root of the characteristic equation, the general term may be
written in the form [16]

σ n − σ −n
Pk,n = .
σ + σ −1

and the limit of the quotient of two terms is

Pk,n+1
lim = σ.
n→∞ Pk,n

3. On the Generating Functions

In our main result, we will combine all these results in a unified way such that they
can be considered as a special case of the following Theorem.

Theorem 3.1. Given two alphabets P = { p1 , p2 } and B = {b1 , b2 , ..., bn } , we have

∞
∞ ∑ Sn (− B)δp1 p2 ( p2n )tn
∑ Sn ( B)δnp1 p2 ( p1 )tn =  ∞
n =0
(3.1) 
∞
.
n n
n =0 ∑ Sn (− B) p1 t n ∑ Sn (− B) p2 t n
n =0 n =0
 K-PELL SEQUENCES AND CHEBYCHEV POLYNOMIALS 5

∞
Proof. By applying the operator δp1 p2 to the series g( p1 t) = ∑ Sn ( B) p1n tn , we have
n =0

∞
!
δ p1 p2 g ( p 1 t ) = δ p1 p2 ∑ Sn ( B) p1n tn
n =0
∞ ∞
p1 ∑ Sn ( B) p1n tn − p2 ∑ Sn ( B) p2n tn
n =0 n =0
=
p1 − p2
∞
!
p1n+1 − p2n+1
= ∑ Sn ( B ) p1 − p2
tn
n =0
∞
= ∑ Sn ( B)δnp1 p2 ( p1 )tn .
n =0

Which is the left-hand side of (3.1). On the other part, setting

1
g ( p1 t ) = ∞ ,
∑ Sn (− B) p1n tn
n =0

we have
p1 ∏ (1 − bp2 )t − p2 ∏ (1 − bp1 t)
b∈ B
δ p1 p2 g ( p 1 t ) = b∈B .
∞ ∞

n
( p1 − p2 ) ∑ Sn (− B) p1 t n
n ∑ Sn (− B) p2 t n
n =0 n =0
∞
Using the fact that : ∑ Sn (− B) p1n tn = ∏ (1 − bp1 t), then
n =0 b∈ B
∞ p pn − p pn
∑ Sn (− B) p21 − p2 1 tn
1 2

n =0
δ p1 p2 g ( p 1 t ) =  ∞ 
∞

n n
∑ Sn (− B) p1 tn ∑ Sn (− B) p2 tn
n =0 n =0
∞
∑ Sn (− B)δp1 p2 ( p2n )tn
n =0
=  ∞ 
∞
.
n n
∑ Sn (− B) p1 t n ∑ Sn (− B) p2 t n
n =0 n =0

This completes the proof. 

We now derive new generating functions of the products of some well-known poly-
nomials. Indeed, we consider Theorem 1 in order to derive Fibonacci numbers and
Chebychev polynomials of second kind and the symmetric functions.

Online Journal of Analytic Combinatorics, Issue 14 (2019), #03

6 ALI BOUSSAYOUD AND SOUHILA BOUGHABA

Theorem 3.2. [8] Given two alphabets P = { p1 , p2 } and B = {b1 , b2 , b3 } , we have

∞
S0 (− B) − p1 p2 S2 (− B)t2 − p1 p2 S3 (− B) ( p1 + p2 ) t3
(3.2) ∑ Sn ( B)δnp1 p2 ( p1 )tn = 
∞

∞
 .
n n
n =0 ∑ Sn (− B) p1 t n ∑ Sn (− B) p2 t n
n =0 n =0

Case 1: For p1 = b1 = 1, b2 = y and p2 = x , b3 = α in Theorem 2, we propose the

following new generating function
∞
1 − x (y + α + αy)t2 − xyα(1 + x )t3
∑ δx1
n
( x ) Sn (1 + y + α ) t n =
(1 − t) (1 − xt) (1 − yt) (1 − xyt) (1 − αt)(1 − αxt)
.
n =0

Remark 3.1. For α = 0, we obtain the following identity of Ramanujan [12, 13]
∞
1 − xyt2
∑ δx1
n
( x ) Sn (1 + y ) t n =
(1 − t) (1 − xt) (1 − yt) (1 − xyt)
.
n =0

Case 2: Replacing p2 by (− p2 ) and assuming that p1 p2 = 1, p1 − p2 = k in Theorem

2, we derive a new generating function of both k-Fibonacci numbers and symmetric
functions in several variables as follows
∞
1 − S2 (− B)t2 − kS3 (− B)t3
(3.3) ∑ Sn ( B) Fk,n tn = ∏ i = 13 1 − kb t − b2 t2
.
n =0 i i
Replacing t by (−t) in (3.3), we have the following corollary.
Corollary 3.2. [5] We have the following generating function of both k-Fibonacci numbers at
negative indices and symmetric functions in several variables as

∞ −1 + S2 (− B)t2 − kS3 (− B)t3

∑ Sn ( B) Fk,−n t =
n
∏3i=1 1 + kbi t − bi2 t2

.
n =0

• Put k = 1 in the relationship (3.3) we have

∞
1 + (b1 b2 + b1 b3 + b2 b3 ) t2 + b1 b2 b3 t3
∑ Sn ( B) Fn t =
n
3
,
n =0 2
∏ 1 − bi t − bi t


2
i =1
representing a generating function of Fibonacci numbers and symmetric
functions in several variables [8].
Setting b3 = 0 and replacing b2 by (−b2 ) in (3.3), and assuming b1 − b2 = k; b1 b2 = 1;
we deduce the following corollary.
Corollary 3.3. [9] For n ∈ N, the generating function of the product of k-Fibonacci numbers
is given by
∞
1 − t2
∑ k,n
F 2 n
t =
1 − k 2 t − 2( k 2 + 1) t2 − k 2 t3 + t4
.
n =0
 K-PELL SEQUENCES AND CHEBYCHEV POLYNOMIALS 7

Case 3: Replacing p2 by (− p2 ) and assuming that p1 p2 = k, p1 − p2 = 2 in Theorem

2, we derive a new generating function of both k-Pell numbers and symmetric functions
in several variables as follows
∞
t − kS2 (− B)t3 − 2kS3 (− B)t4
(3.4) ∑ Sn−1 ( B) Pk,n tn =
∏3i=1 1 − 2bi t − kbi2 t2

.
n =0

Replacing t by (−t) in (3.4) , we have the following corollary.

Corollary 3.4. We have the following a new generating function of both k-Pell numbers at
negative indices and symmetric functions in several variables as

∞
t − kS2 (− B)t3 + 2kS3 (− B)t4
∑ Sn−1 ( B) Pk,−n t = ∏3 1 − 2b t − kb2 t2
.
n
n =0 i =1 i i

• Put k = 1 in the relationship (3.4) we have

∞
t − S2 (− B)t3 − 2S3 (− B)t4
∑ Sn−1 ( B) Pn tn =
∏3i=1 1 − 2bi t − bi2 t2

,
n =0

which representing a new generating function of Pell numbers and symmetric

functions in several variables.
Setting b3 = 0 and replacing b2 by (−b2 ) in (3.4), and assuming b1 − b2 = 2; b1 b2 = k;
we deduce the following corollary.

Corollary 3.5. For n ∈ N, the generating function of the product of k-Pell numbers is given
by
∞
t − k 2 t3
∑ 2 n
Pk,n t =
1 − 4t − (2k2 + 8k )t2 − 4k2 t3 + k4 t4
.
n =0

We have the following theorems.

Theorem 3.3. For n ∈ N, The new generating function of the product of k-Lucas numbers is
given by

∞
4 − 3k2 t − 4(k2 + 1)t2 − k2 t3
(3.9) ∑ L2k,n tn = 1 − k2 t − 2(k2 + 1)t2 − k2 t3 + t4 .
n =0

Proof. We have

Online Journal of Analytic Combinatorics, Issue 14 (2019), #03

8 ALI BOUSSAYOUD AND SOUHILA BOUGHABA

∞ ∞
∑ L2k,n tn = ∑ [(2 + k2 )Sn (e1 + [−e2 ]) − kSn+1 (e1 + [−e2 ])]
n =0 n =0
×[(2 + k2 )Sn ( a1 + [− a2 ]) − kSn+1 ( a1 + [− a2 ])]tn
∞
= (2 + k 2 )2 ∑ Sn (e1 + [−e2 ])Sn (a1 + [−a2 ])tn −
n =0
∞
k (2 + k 2 ) ∑ Sn+1 (e1 + [−e2 ])Sn (a1 + [−a2 ])tn
n =0
∞
− k (2 + k ) 2
∑ Sn+1 (a1 + [−a2 ])Sn (e1 + [−e2 ])tn +
n =0
∞
k2 ∑ Sn+1 (e1 + [−e2 ])Sn+1 (a1 + [−a2 ])tn
n =0
∞
= (2 + k ) 2 2
∑ Fk,n
2 n
t − k (2 + k 2 )
n =0
" #
k + ( a1 − a2 ) t
×
1 − k( a1 − a2 )t − [( a1 − a2 )2 + 2a1 a2 + k2 a1 a2 ]t2 − k( a1 − a2 ) a1 a2 t3 + a21 a22 t4
" #
k + ( e 1 − e 2 ) t
− k (2 + k 2 )
1 − k (e1 − e2 )t − [(e1 − e2 ) + 2e1 e2 + k e1 e2 ]t2 − k (e1 − e2 )e1 e2 t3 + e12 e22 t4
2 2
" #
k ( a − a ) + [( a − a ) 2 + a a + k2 a a ] t + ka a ( a − a ) t2 − a2 a2 t3
1 2 1 2 1 2 1 2 1 2 1 2
+ k2 1 2
.
1 − k ( a1 − a2 )t − [( a1 − a2 )2 + 2a1 a2 + k2 a1 a2 ]t2 − k ( a1 − a2 ) a1 a2 t3 + a21 a22 t4
Since
∞
1 − t2
∑ 2 n
Fk,n t =
1 − k 2 t − 2( k 2 + 1) t2 + k 2 t3 + t4
.
n =0
Therefore
∞
4 − 3k2 t − 4(k2 + 1)t2 − k2 t3
∑ L2k,n tn = 1 − k2 t − 2(k2 + 1)t2 − k2 t3 + t4 .
n =0
This completes the proof. 
Theorem 3.4. For n ∈ N, The new generating function of the product of k-Pell Lucas numbers
is given by
∞
4 − 12t − 4(4k + k2 )t2 − 4k2 t3
(3.10) ∑ Q2k,n tn = 1 − 4t − 2(4k + k2 )t2 − 4k2 t3 + k4 t4 .
n =0
 K-PELL SEQUENCES AND CHEBYCHEV POLYNOMIALS 9

Proof. We have

∞ ∞
∑ Q2k,n tn = ∑ [Sn+1 (e1 + [−e2 ]) − (k + 2)Sn−1 (e1 + [−e2 ])]
n =0 n =0
×[Sn+1 ( a1 + [− a2 ]) − (k + 2)Sn−1 ( a1 + [− a2 ])]tn
∞
!
= ∑ Sn+1 (e1 + [−e2 ])Sn+1 (a1 + [−a2 ])tn − (k + 2) ×
n =0
∞
!
∑ Sn+1 (e1 + [−e2 ])Sn−1 (a1 + [−a2 ])tn
n =0
∞
−(k + 2) ∑ Sn+1 (a1 + [−a2 ])Sn−1 (e1 + [−e2 ])tn +
n =0
∞
( k + 2)2 ∑ Sn−1 (e1 + [−e2 ])Sn−1 (a1 + [−a2 ])tn
n =0
" #
2( a1 − a2 ) + k ( a1 − a2 )2 + ka1 a2 + 4a1 a2 t + 2ka1 a2 ( a1 − a2 )t2 − k2 a21 a22 t3
 
=
1 − 2( a1 − a2 )t − [k ( a1 − a2 )2 + 2ka1 a2 + 4a1 a2 ] t2 − 2k ( a1 − a2 ) a1 a2 t3 + k2 a21 a22 t4
" #
(k + 4)t + 2k( a1− a2 )t2 − k2 a1 a2 t3
−(k + 2)
1 − 2( a1 − a2 )t − [k ( a1 − a2 )2 + 2(k + 2) a1 a2 ] t2 − 2k ( a1 − a2 ) a1 a2 t3 + k2 a21 a22 t4
" #
(k + 4)t + 2k(e1− e2 )t2 − k2 e1 e2 t3
−(k + 2)
1 − 2(e1 − e2 )t − [k (e1 − e2 )2 + 2(k + 2)e1 e2 ] t2 − 2k(e1 − e2 )e1 e2 t3 + k2 e12 e22 t4
∞
+(k + 2)2 ∑ Pk,n
2 n
t .
n =0
Since
∞
t − k 2 t3
∑ 2 n
Pk,n t =
1 − 4t − 2(4k + k2 )t2 − 4k2 t3 + k4 t4
.
n =0
Therefore
∞
4 − 12t − 4(4k + k2 )t2 − 4k2 t3
∑ Q2k,n tn =
1 − 4t − 2(4k + k2 )t2 − 4k2 t3 + k4 t4
.
n =0
This completes the proof. 
Case 4: Replacing p1 by 2p1 and p2 by (−2p2 ), and assuming that 4p1 p2 = −1 in
Theorem 2 allows us to deduce the Chebyshev polynomials of second kind and the
symmetric functions in several variables, as follows for y = p1 − p2 ,
∞
1 − S2 (− B)t2 − S3 (− B)t3
(3.5) ∑ Sn ( B)Un (y)tn =
1 − 2b1 yt − b12 t2 1 − 2b2 yt − b22 t2 1 − 2b3 yt − b32 t2



.
n =0

Online Journal of Analytic Combinatorics, Issue 14 (2019), #03

10 ALI BOUSSAYOUD AND SOUHILA BOUGHABA

Theorem 3.5. The new generating function of the product of Chebyshev polynomials of first
kind and the symmetric functions in several variables as

(3.6)
∞
1 − yS1 (− B)t + S2 (− B)(2y2 − 1)t2 + S3 (− B)(y − 4y3 − 1)t3
∑ Sn ( B)Tn (y)tn = 1 − 2b1 yt − b12 t2 1 − 2b2 yt − b22 t2 1 − 2b3 yt − b32 t2



.
n =0
Proof. We have

∞ ∞
∑ Sn ( B) Tn (y)tn = ∑ Sn ( B)(Sn ((2p1 ) + (−2p2 )) − ySn ((2p1 ) + (−2p2 ))tn
n =0 n =0
∞
= ∑ Sn ( B)Sn ((2p1 ) + (−2p2 ))tn −
n =0
∞
y ∑ Sn ( B)Sn ((2p1 ) + (−2p2 )tn
n =0
∞ ∞
y
= ∑ Sn ( B)Un (y)tn − 2( p1 + p2 ) ∑ Sn ( B)((2p1 )n − (−2p2 )n )tn .
n =0 n =0
Since
∞
1
∑ Sn (b1 + b2 + b3 )tn = ∏ ,
n =0 b∈ B (1 − bt )
Therefore

∞ ∞  
y 1 1
∑ Sn ( B)Tn (y)t n
= ∑ Sn ( B)Un (y)t − n
−
2( p1 + p2 ) ∏b∈ B (1 − 2p1 bt) ∏b∈ B (1 + 2p2 bt)
n =0 n =0
1 − yS1 (− B)t + S2 (− B)(2y2 − 1)t2 + S3 (− B)(y − 4y3 − 1)t3
=
.
1 − 2b1 yt − b12 t2 1 − 2b2 yt − b22 t2 1 − 2b3 yt − b32 t2

This completes the proof. 

• Let b3 = 0, by making the following restrictions: p1 − p2 = k, p1 p2 = 1,
4b1 b2 = −1, and by replacing (b1 − b2 ) by 2(b1 − b2 ) in (3.2), we get a new
generating function, involving the product of k-Fibonacci numbers with Cheby-
shev polynomial of second kind as follows
∞
∑ Sn (2b1 + [−2b2 ])Sn ( p1 + [− p2 ])tn
n =0

1 + t2
= .
1 − 2k (b1 − b2 )t − (4(b1 − b2 )2 − (k2 + 2))t2 + 2k (b1 − b2 )t3 + t4
Thus we conclude with the following corollary.
 K-PELL SEQUENCES AND CHEBYCHEV POLYNOMIALS 11

Corollary 3.6. We have the following a new generating function of the product of k-Fibonacci
numbers and Chebyshev polynomials of second kind as
(3.7)
∞
1 + t2
∑ k,n n 1 2
F U ( b − b ) t n
=
1 − 2k ( b1 − b2 ) t − ( 4 ( b1 − b2 ) 2 − ( k2 + 2)) t2 + 2k ( b − b ) t3 + t4
1 2
.
n =0

Put k = 2 in the relationship (3.7) we get

∞
t + t3
∑ Pn Un−1 (b1 − b2 )tn = 1 − 4(b1 − b2 )t + (6 − 4(b1 − b2 )2 )t2 + 4(b1 − b2 )t3 + t4 ,
n =0

which represents a new generating function, involving the product of Pell numbers
with Chebyshev polynomials of second kind.

Theorem 3.6. For n ∈ N, The new generating of the product of k−Fibonacci numbers and
Chebyshev polynomials of first kind as

(3.8)
∞
1 − k (b1 − b2 )t + (1 − 2(b1 − b2 )2 )t2
∑ Fk,n Tn (b1 − b2 )tn =
1 − 2k (b1 − b2 )t − (4(b1 − b2 )2 − (k2 + 2))t2 + 2k (b1 − b2 )t3 + t4
.
n =0

Proof. We have

∞ ∞
∑ Fk,n Tn (b1 − b2 )t n
= ∑ Fk,n (Sn (2b1 + [−2b2 ]) − (b1 − b2 )Sn−1 (2b1 + [−2b2 ]))tn
n =0 n =0

∞ ∞
= ∑ Fk,n Sn (2b1 + [−2b2 ])tn − (b1 − b2 ) ∑ Fk,n Sn−1 (2b1 + [−2b2 ])tn
n =0 n =0
∞ ∞
(b1 − b2 )
= ∑ Fk,n Un (b1 − b2 )tn − 2(b1 + b2 ) ∑ Fk,n ((2b1 )n − (−2b2 )n )tn .
n =0 n =0
Since

∞
1
∑ Fk,n tn = 1 − kt − t2 ,
n =0
Therfore

∞
1 − k(b1 − b2 )t + (1 − 2(b1 − b2 )2 )t2
∑ Fk,n Tn (b1 − b2 )tn =
1 − 2k (b1 − b2 )t − (4(b1 − b2 )2 − (k2 + 2))t2 + 2k (b1 − b2 )t3 + t4
.
n =0

This completes the proof. 

Online Journal of Analytic Combinatorics, Issue 14 (2019), #03

12 ALI BOUSSAYOUD AND SOUHILA BOUGHABA

Put k = 2 in the relationship (3.7) we get

∞
t − k (b1 − b2 )t2 + (1 − 2(b1 − b2 )2 )t3
∑ Pn Tn−1 (b1 − b2 )tn = 1 − 4(b1 − b2 )t + (6 − 4(b1 − b2 )2 )t2 + 4(b1 − b2 )t3 + t4 .
n =0
which represents a new generating function, involving the product of Pell with
Chebyshev polynomial of first kind.

4. Conclusion
In this paper, a new theorem has been proposed in order to determine the generating
functions. The proposed theorem is based on the symmetric functions. The obtained
results agree with the results obtained in some previous works.
Acknowledgments. The authors would like to thank the anonymous referees for
reading carefully the paper and giving helpful comments and suggestions.

References
[1] A. Boussayoud, On Some Identities and Symmetric Functions for Balancing Numbers, Jour-
nal of New Theory. 23 (2018), 68-77.
[2] Kh. Boubellouta, A. Boussayoud and M. Kerada, Symmetric Functions for k-Fibonacci
Numbers and Orthogonal Polynomials, Turkish Journal of Analysis and Number.6(3) (2018),
98-102.
[3] A. Boussayoud, S. Boughaba and M. Kerada, Generating Functions k-Fibonacci and k-
Jacobsthal numbers at negative indices, Electron. J. Math. Analysis Appl. 6(2) (2018), 195-202.
[4] A. Boussayoud, M. Chelgham and S. Boughaba, On Some Identities and Generating Func-
tions for Mersenne Numbers and Polynomials, Turkish Journal of Analysis and Number.6(3)
(2018), 93-97.
[5] A. Boussayoud, Symmetric functions for k-Pell Numbers at negative indices, Tamap Journal
of Mathematics and Statistics.1 (2017), 1-8.
[6] A. Boussayoud, M. Kerada and N. Harrouche, On the k-Lucas numbers and Lucas Polyno-
mials, Turkish Journal of Analysis and Number.5(3) (2017), 121-125.
[7] A. Boussayoud, On some identities and generating functions for Pell-Lucas numbers, On-
line.J. Anal. Comb. 12 #1 (2017), 1-10.
[8] A. Boussayoud and A. Abderrezzak, Complete Homogeneous Symmetric Function, Ars
Comb, (accepted)
[9] A. Boussayoud and N. Harrouche, Complete Symmetric Functions and k- Fibonacci Num-
bers, Commun. Appl. Anal. 20 (2016), 457-467.
[10] A. Abderrezzak, M. Kerada and A. Boussayoud, Generalization of Some Hadamard Prod-
uct, Commun. Appl. Anal. 20 (2016), 301-306.
[11] A. Boussayoud, M. Boulyer and M. Kerada, A simple and accurate method for determina-
tion of some generalized sequence of numbers, Int. J. Pure Appl. Math.108 (2016), 503-511.
[12] A. Boussayoud, A. Abderrezzak and M. Kerada, Some applications of symmetric functions,
Integers. 15, A#48 (2015), 1-7.
 K-PELL SEQUENCES AND CHEBYCHEV POLYNOMIALS 13

[13] A. Boussayoud, M. Kerada, R. Sahali and W. Rouibah, Some Applications on Generating

Functions, J. Concr. Appl. Math. 12 (2014), 321-330.
[14] AT. Benjamin and JJ. Quinn, Proofs That Really Count: The Art of Combinatorial Proof,
Mathematical Association of America, Washington, DC, 2003.
[15] C. Bolat and H Kose, On the Properties of k-Fibonacci Numbers, Int. J. Contemp. Math.
Sciences. 5 (2010), 1097-1105.
[16] P. Catarino, On Some Identities and Generating Functions for k- Pell Numbers, Int. Journal
of Math. Analysis. 7 (2013), 1877-1884.
[17] P. Catarino and P. Vasco, On Some Identities and Generating Functions for k-Pell Lucas
Sequences, Applied Mathematical Sciences. 7 (2013), 4867- 4873.
[18] J. Ercolano, Matrix Generators of Pell Sequences, Fibonacci Q.17 (1979), 71- 77.
[19] A.F Horadam, Basic properties of a certain generalized sequence of numbers, Fibonacci Q.
3 (1965), 161–176.
[20] A.F Horadam, Generating functions for powers of a certain generalized sequence of num-
bers, Duke Math. J. 32 (1965), 437–446.
[21] A.F. Horadam and J.M. Mahon, Pell and Pell-Lucas Polynomials, Fibonacci Q. 23 (1985),
7–20.
[22] S. Falcon and A. Plaza, On the Fibonacci k- numbers, Chaos, Sulutions & Fractals. 32 (2007),
1615-1624.
[23] S. Falcon and A. Plaza, The k- Fibonacci sequence and the Pascal 2-triangle, Chaos, Sulutions
& Fractals. 33 (2008), 38-49.
[24] S. Falcon and A. Plaza, On k- Fibonacci sequences and Polynomials and their derivatives,
Chaos, Sulutions & Fractals 39 (2009), 1005-1019.
[25] S. Falcon, On the k-Lucas numbers, Int. J. Contemp. Math. Sciences. 6 (2011), 1039-1050.
[26] H. Gokkaya and K. Uslu, On the properties of new families of Pell and Pell-Lucas numbers,
Ars Comb. CXVII (2014), 311-318.
[27] T.Mansour. A formula for the generating functions of powers of Horadam’s sequence, Aus-
tralas. J. Comb. 30 (2004), 207–212.
[28] E. Kiliç and D. Tasçi, The Generalized Binet Formula, Representation and Sums of the
Generalized Order k-Pell Numbers, Taiwanese J. Math. 10(6) (2006), 1661 -1670.
[29] M. Kerada, A. Boussayoud and A. Abderrezzak, Generalization of some hypergeometric
functions, Indag. Maths.28 (2017), 711-720.
[30] VE. Hoggat, Fibonacci and Lucas numbers, Palo Alto, CA: Houghton-Mifflin, 1969.

LMAM Laboratory and Department of Mathematics, Mohamed Seddik Ben Yahia University,
Jijel, Algeria.
E-mail address: aboussayoud@yahoo.fr, souhilaboughaba@gmail.com

Online Journal of Analytic Combinatorics, Issue 14 (2019), #03