Next Article in Journal
Electricity Cost Optimization in Energy Storage Systems by Combining a Genetic Algorithm with Dynamic Programming
Previous Article in Journal
Parameter Estimation and Hypothesis Testing of Geographically Weighted Multivariate Generalized Poisson Regression
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Relations between Generalized Bi-Periodic Fibonacci and Lucas Sequences

Department of Electronic and Electrical Convergence Engineering, Hongik University, Sejong-Ro 2639, Sejong 30016, Korea
Mathematics 2020, 8(9), 1527; https://doi.org/10.3390/math8091527
Submission received: 13 August 2020 / Revised: 28 August 2020 / Accepted: 4 September 2020 / Published: 7 September 2020
(This article belongs to the Section Mathematics and Computer Science)

Abstract

:
In this paper we consider a generalized bi-periodic Fibonacci { f n } and a generalized bi-periodic Lucas sequence { q n } which are respectively defined by f 0 = 0 , f 1 = 1 , f n = a f n 1 + c f n 2 (n is even) or f n = b f n 1 + c f n 2 (n is odd), and q 0 = 2 d , q 1 = a d , q n = b q n 1 + c q n 2 (n is even) or q n = a f n 1 + c q n 2 (n is odd). We obtain various relations between these two sequences.

1. Introduction

As is well known, the Fibonacci sequence { F n } is generated from the recurrence relation F n = F n 1 + F n 2 with initial condition F 0 = 0 , F 1 = 1 , and the Lucas sequence { L n } satisfies the same recurrence relation with initial condition L 0 = 2 , L 1 = 1 . The Fibonacci and Lucas numbers possess many interesting properties and appear in a variety of application fields [1].
The Binet’s formulas for { F n } and { L n } are respectively given by
F n = α n β n α β and L n = α n + β n ,
where α and β are roots of the equation x 2 x 1 = 0 .
Many authors generalized the Fibonacci and Lucas sequences by changing initial conditions and/or recurrence relations. As a generalization of the Fibonacci sequence, Edson and Yayenie [2] introduced a bi-periodic Fibonacci sequence { p n } defined by
p 0 = 0 , p 1 = 1 , p n = a p n 1 + p n 2 , if     n     is     even b p n 1 + p n 2 , if     n     is     odd ( n 2 ) .
They obtained the Binet’s formula and proved many interesting properties of { p n } .
If a = b = 1 , then { p n } becomes the Fibonacci sequence. For a = b = 2 , { p n } denotes the Pell sequence. In addition, if a = b = k , then { p n } denotes the k-Fibonacci sequence defined in [3], etc.
On the other hand, Bilgici [4] generalized the Lucas sequence by introducing a bi-periodic Lucas sequence { l n } defined by
l 0 = 2 , l 1 = a , l n = b l n 1 + l n 2 , if     n     is     even a l n 1 + l n 2 , if     n     is     odd ( n 2 ) ,
and proved many interesting relations between { p n } and { l n } .
If a = b = 1 , then { l n } becomes the Lucas sequence. For a = b = 2 , { l n } denotes the Pell-Lucas sequence. If a = b = k , then { l n } becomes the k-Lucas sequence defined in [5].
In this paper we consider a generalized bi-periodic Fibonacci sequence { f n } and a generalized bi-periodic Lucas sequence { q n } which are generalizations of { p n } and { l n } respectively, and are defined as
f 0 = 0 , f 1 = 1 , f n = a f n 1 + c f n 2 , if     n     is     even b f n 1 + c f n 2 , if     n     is     odd ( n 2 ) ,
and
q 0 = 2 d , q 1 = a d , q n = b q n 1 + c q n 2 , if     n     is     even a q n 1 + c q n 2 , if     n     is     odd ( n 2 ) ,
where a, b, c and d are nonzero real numbers.
If c = 1 , { f n } becomes { p n } defined in (1). If a = b = 2 and c = k , { f n } becomes the k-Pell sequence defined in [6]. If a = b = 1 and c = 2 , { f n } becomes the Jacobsthal sequence { J n } . If a = b = k and c = 2 , { f n } becomes the k-Jacobsthal sequence defined in [7]. If a = b = s and c = 2 t , { f n } becomes the ( s , t ) -Jacobsthal sequence defined in [8]. If a = b = 6 and c = 1 , { f n } becomes the sequence of balancing numbers { B n } defined in [9]. If c = 1 , { f n } becomes the sequence of bi-periodic balancing numbers defined in [10].
If c = d = 1 , { q n } becomes { l n } defined in (2). If a = b = 2 , c = k and d = 1 , { q n } becomes the k-Pell-Lucas sequence defined in [11]. If a = b = 1 , c = 2 and d = 1 , { q n } becomes the Jacobsthal-Lucas sequence { j n } . If a = b = k , c = 2 and d = 1 , { q n } becomes the k-Jacobsthal-Lucas sequence defined in [12]. If a = b = s , c = 2 t and d = 1 , { q n } becomes the ( s , t ) -Jacobsthal-Lucas sequence defined in [8]. Setting a = 2 a , b = 2 b and c = d = 1 , { q n } becomes the bi-periodic Pell-Lucas sequence defined in [13]. If c = 2 and d = 1 , { q n } becomes the bi-periodic Jacobsthal-Lucas sequence defined in [14]. If a = b = 6 , c = 1 and d = 1 / 2 , { q n } becomes the sequence of Lucas-balancing numbers { b n } defined in [15].
In the next section we derive various relations between { f n } and { q n } . The relations obtained here not only include many existing ones as special cases but also give diverse new results.

2. Results

In this section we derive diverse relations between two sequences { f n } and { q n } respectively given in (3) and (4).
According to ([16] [Theorem 8]) and [17], the Binet’s formulas for { f n } and { q n } are respectively given by
f n = a ζ ( n + 1 ) ( a b ) n 2 α n β n α β ,
q n = d ( a b ) n 2 b ζ ( n ) ( α n + β n ) ,
where α = a b + a 2 b 2 + 4 a b c 2 and β = a b a 2 b 2 + 4 a b c 2 , i.e., α and β are roots of the equation x 2 a b x a b c = 0 , and ζ ( n ) = n 2 n 2 is the parity function such that ζ ( n ) = 0 if n is even and ζ ( n ) = 1 if n is odd.
From (5) and (6), we also have
f n = ( 1 ) n + 1 c n f n and q n = ( 1 ) n c n q n .
In the rest of this section, we will use the following properties without mentioning to prove our main results:
(a)
α + β = a b .
(b)
α · β = a b c .
(c)
m + n 2 m 2 n 2 = ζ ( m ) ζ ( n ) ,
(d)
m 2 + n 2 m n 2 = n ζ ( m ) ζ ( n ) ,
(e)
m 2 + n + 1 2 m + n 2 = ζ ( m + 1 ) ζ ( n ) ,
(f)
m + n 2 m 1 2 n 2 = ζ ( m + 1 ) ζ ( n + 1 ) + ζ ( n ) .
(g)
ζ ( m ) ζ ( n ) + ζ ( m + 1 ) ζ ( m + n + 1 ) = ζ ( m + 1 ) ζ ( n ) .
(h)
ζ ( m ) ζ ( n ) + ζ ( m + 1 ) + ζ ( n + 1 ) = 1 + ζ ( m + 1 ) ζ ( n + 1 ) .
(i)
ζ ( m ) ζ ( m + n ) = 1 ζ ( m + 1 ) ζ ( n + 1 ) .
Theorem 1.
For any integer n, we have
d ( f n + 1 + c f n 1 ) = q n ,
and
q n + 1 + c q n 1 = ( a b + 4 c ) d f n .
Proof. 
From (5) and (6), we have
( a b ) n + 1 2 a ζ ( n ) f n + 1 + a b c ( a b ) n 1 2 a ζ ( n ) f n 1 = α n + 1 β n + 1 + a b c ( α n 1 β n 1 ) α β = α n ( α + a b c α ) β n ( β + a b c β ) α β = α n + β n = ( a b ) n 2 b ζ ( n ) d q n ,
from which we obtain (7).
Similarly we can show that
( a b ) n + 1 2 b ζ ( n + 1 ) d q n + 1 + a b c ( a b ) n 1 2 b ζ ( n 1 ) d q n 1 = a b ( a b + 4 c ) ( a b ) n 2 a ζ ( n + 1 ) f n ,
from which we obtain (8).  ☐
If c = d = 1 , Theorem 1 reduces to ([4] [Theorem 3]).
If a = b = d = 1 and c = 2 , then (7) and (8) respectively reduce to the known identities
J n + 1 + 2 J n 1 = j n ,
and
j n + 1 + 2 j n 1 = 9 J n .
If a = b = 6 , c = 1 and d = 1 / 2 , we obtain the new identities
B n + 1 B n 1 = 2 b n ,
and
b n + 1 b n 1 = 16 B n .
Theorem 2.
For any integer n, we have
d ( f n + 2 c 2 f n 2 ) = a ζ ( n + 1 ) b ζ ( n ) q n ,
and
q n + 2 c 2 q n 2 = a ζ ( n ) b ζ ( n + 1 ) ( a b + 4 c ) d f n .
Proof. 
From (5) and (6), we have
( α β ) ( f n + 2 c 2 f n 2 ) = a ζ ( n + 3 ) ( a b ) n + 2 2 ( α n + 2 β n + 2 ) a ζ ( n 1 ) ( a b ) n 2 2 c 2 ( α n 2 β n 2 ) = a ζ ( n + 1 ) ( a b ) n 2 α n + 2 β n + 2 a b a b c 2 ( α n 2 β n 2 ) = a ζ ( n + 1 ) ( a b ) n 2 α n + 2 a 2 b 2 c 2 α n 2 a b β n + 2 a 2 b 2 c 2 β n 2 a b = a ζ ( n + 1 ) ( a b ) n 2 ( α β ) ( α n + β n ) = a ζ ( n + 1 ) b ζ ( n ) d ( α β ) q n ,
and we obtain (9).
The proof of (10) is similar, and is omitted.  ☐
For a = b = 1 , c = 2 and d = 1 , we obtain the known identities
J n + 2 4 J n 2 = j n ,
and
j n + 2 4 j n 2 = 9 J n .
For a = b = 6 , c = 1 and d = 1 / 2 , (9) and (10) respectively reduce to the new identities
B n + 2 B n 2 = 12 b n ,
and
b n + 2 b n 2 = 96 B n .
Theorem 3.
For any integers m and n, we have
b a ζ ( m + 1 ) ζ ( n ) f m q n + b a ζ ( m ) ζ ( n + 1 ) f n q m = 2 d f m + n ,
and
b a ζ ( m ) ζ ( n ) q m q n + ( a b + 4 c ) d 2 b a ζ ( m + 1 ) ζ ( n + 1 ) f m f n = 2 d q m + n .
Proof. 
From (5) and (6), we have
( a b ) m 2 + n 2 b ζ ( n ) d a ζ ( m + 1 ) f m q n + ( a b ) m 2 + n 2 b ζ ( m ) d a ζ ( n + 1 ) f n q m = 2 ( α m + n β m + n ) α β = 2 ( a b ) m + n 2 a ζ ( m + n + 1 ) f m + n ,
or
a ζ ( m + n + 1 ) ζ ( m + 1 ) b ζ ( n ) ( a b ) ζ ( m ) ζ ( n ) f m q n + a ζ ( m + n + 1 ) ζ ( n + 1 ) b ζ ( m ) ( a b ) ζ ( m ) ζ ( n ) f n q m = 2 d f m + n .
Since
a ζ ( m + n + 1 ) ζ ( m + 1 ) b ζ ( n ) ( a b ) ζ ( m ) ζ ( n ) = b a ζ ( m + 1 ) ζ ( n ) ,
we obtain (11).
Also we have
( a b ) m 2 + n 2 b ζ ( m ) + ζ ( n ) d 2 q m q n + ( a b ) m 2 + n 2 ( α β ) 2 a ζ ( m + 1 ) + ζ ( n + 1 ) f m f n = 2 ( α m + n + β m + n ) = 2 ( a b ) m + n 2 b ζ ( m + n ) d q m + n ,
or
b a ζ ( m ) ζ ( n ) q m q n + a b ( a b + 4 c ) d 2 a ζ ( m + 1 ) + ζ ( n + 1 ) ( a b ) ζ ( m ) ζ ( n ) b ζ ( m + n ) f m f n = 2 d q m + n .
Since
a b a ζ ( m + 1 ) + ζ ( n + 1 ) ( a b ) ζ ( m ) ζ ( n ) b ζ ( m + n ) = b a ζ ( m + 1 ) ζ ( n + 1 ) ,
then we obtain (12).  ☐
If c = d = 1 , then (11) reduces to the second identity in ([4] [Theorem 5]). Also, using the same notation as in [4], the first identity in ([4] [Theorem 5]) should be corrected as
l m + n = 1 2 ( a b + 4 ) b a ζ ( m + 1 ) ζ ( n + 1 ) q m q n + b a ζ ( m ) ζ ( n ) l m l n .
If a = b = d = 1 and c = 2 , then (11) and (12) respectively reduce to the known identities
J m j n + J n j m = 2 J m + n ,
and
j m j n + 9 J m J n = 2 j m + n .
If a = b = 6 , c = 1 and d = 1 / 2 , then (11) reduces to the known identity
B m b n + B n b m = B m + n ,
and (12) reduces to the new identity
b m b n + 8 B m B n = b m + n .
Replacing n by n in Theorem 3, we obtain the following result.
Corollary 1.
For any integers m and n, we have
b a ζ ( m + 1 ) ζ ( n ) f m q n b a ζ ( m ) ζ ( n + 1 ) f n q m = ( 1 ) n 2 c n d f m n ,
and
b a ζ ( m ) ζ ( n ) q m q n ( a b + 4 c ) d 2 b a ζ ( m + 1 ) ζ ( n + 1 ) f m f n = ( 1 ) n 2 c n d q m n .
If c = d = 1 , then (13) reduces to the first identity in ([4] [Corollary 3]). Also, using the same notation as in [4], the second identity in ([4] [Corollary 3]) should be corrected as
l m n = ( 1 ) n 2 b a ζ ( m ) ζ ( n ) l m l n ( a b + 4 c ) d 2 b a ζ ( m + 1 ) ζ ( n + 1 ) q m q n .
If a = b = d = 1 and c = 2 , (13) and (14) respectively reduce to the known identities
J m j n J n j m = ( 1 ) n 2 n + 1 J m n ,
and
j m j n 9 J m J n = ( 1 ) n 2 n + 1 j m n .
For a = b = 6 , c = 1 and d = 1 / 2 , (13) leads to the known identity
B m b n B n b m = B m n ,
and (14) leads to the new identity
b m b n 8 B m B n = b m n .
Theorem 4.
For any integers m and n, we have
b a ζ ( m ) ζ ( n ) f m + 1 q n + c b a ζ ( m + 1 ) ζ ( n + 1 ) f m q n 1 = q m + n .
Proof. 
From (5) and (6), we have
( a b ) m + 1 2 + n 2 b ζ ( n ) d a ζ ( m ) f m + 1 q n + a b c ( a b ) m 2 + n 1 2 b ζ ( n + 1 ) d a ζ ( m + 1 ) f m q n 1 = ( α m + 1 β m + 1 ) ( α n + β n ) + a b c ( α m β m ) ( α n 1 + β n 1 ) α β = α m + n ( α + a b c α ) β m + n ( β + a b c β ) α n 1 β m ( α β + a b c ) + α m β n 1 ( α β + a b c ) α β = α m + n + β m + n = ( a b ) m + n 2 b ζ ( m + n ) d q m + n ,
or
( a b ) ζ ( m ) ζ ( n + 1 ) b ζ ( n ) a ζ ( m ) b ζ ( m + n ) f m + 1 q n + a b c b ζ ( n + 1 ) a ζ ( m + 1 ) b ζ ( m + n ) ( a b ) ζ ( m ) + ζ ( m + 1 ) ζ ( n + 1 ) f m q n 1 = q m + n .
We can easily show that
( a b ) ζ ( m ) ζ ( n + 1 ) b ζ ( n ) a ζ ( m ) b ζ ( m + n ) = b a ζ ( m ) ζ ( n ) ,
and
a b b ζ ( n + 1 ) a ζ ( m + 1 ) b ζ ( m + n ) ( a b ) ζ ( m ) + ζ ( m + 1 ) ζ ( n + 1 ) = b a ζ ( m + 1 ) ζ ( n + 1 ) .
Hence we obtain (15).  ☐
Theorem 4 is a generalization of ([4] [Theorem 8]).
If a = b = d = 1 and c = 2 , then (15) reduces to the known identity
J m + 1 j n + J m j n 1 = j m + n .
For a = b = 6 , c = 1 and d = 1 / 2 , we obtain the new identity
B m + 1 b n B m b n 1 = b m + 1 .
Replacing n by n in Theorem 4, we obtain the following result.
Corollary 2.
For any integers m and n, we have
b a ζ ( m ) ζ ( n ) f m + 1 q n b a ζ ( m + 1 ) ζ ( n + 1 ) f m q n + 1 = ( 1 ) n c n q m n .
If a = b = d = 1 and c = 2 , then (16) reduces to the known identity
J m + 1 j n J m j n + 1 = ( 1 ) n 2 n j m n .
If a = b = 6 , c = 1 and d = 1 / 2 , then (16) reduces to the new identity
B m + 1 b n B m b n + 1 = b m n .
Theorem 5.
For any integer n, we have
b a d q 2 n + 1 f 2 n = f 4 n + 1 c 2 n ,
and
b a d q 2 n + 1 f 2 n + 2 = f 4 n + 3 c 2 n + 1 .
Proof. 
From (5) and (6), we have
( a b ) 2 n + 1 2 + 2 n 2 b ζ ( 2 n + 1 ) a ζ ( 2 n + 1 ) d q 2 n + 1 f 2 n = ( a b ) 2 n b a d q 2 n + 1 f 2 n = α 4 n + 1 β 4 n + 1 α β ( a b c ) 2 n = ( a b ) 4 n + 1 2 a ζ ( 4 n + 2 ) f 4 n + 1 ( a b c ) 2 n = ( a b ) 2 n f 4 n + 1 ( a b c ) 2 n ,
from which we obtain (17).
The proof of (18) is similar, and is omitted.  ☐
Theorem 5 is an extension of ([4] [Theorem 12]).
For a = b = d = 1 and c = 2 , (17) and (18) respectively reduce to the known identities
j 2 n + 1 J 2 n = J 4 n + 1 4 n ,
and
j 2 n + 1 J 2 n + 2 = J 4 n + 3 2 · 4 n .
If a = b = 6 , c = 1 and d = 1 / 2 , then (17) and (18) respectively reduce to the known identities
2 b 2 n + 1 B 2 n = B 4 n + 1 1 ,
and
2 b 2 n + 1 B 2 n + 2 = B 4 n + 3 + 1 .
Various identities given in Theorem 6 below can be proved similarly, and details are omitted.
Theorem 6.
For any integers m and n, we have
d f m + n + ( 1 ) n c n f m n = b a ζ ( m + 1 ) ζ ( n ) f m q n ,
d q m + n + ( 1 ) n c n q m n = b a ζ ( m ) ζ ( n ) q m q n ,
d f m + n ( 1 ) n c n f m n = b a ζ ( m ) ζ ( n + 1 ) f n q m ,
q m + n ( 1 ) n c n q m n = b a ζ ( m + 1 ) ζ ( n + 1 ) ( a b + 4 c ) d f m f n ,
b a ζ ( m ) ζ ( n ) q m f m ( n 1 ) = f m n + ( 1 ) m c m f m ( n 2 ) ,
q n q n + 1 = d q 2 n + 1 + ( 1 ) n a c d 2 ,
c b a ζ ( n ) q n 2 + b a ζ ( n + 1 ) q n + 1 2 = c d q 2 n + d q 2 n + 2 ,
( a b + 4 c ) d b a ζ ( m + 1 ) ζ ( n + 1 ) f m f n = q m + n ( 1 ) n c n q m n ,
c f 2 n + 1 = b a ζ ( n ) f n + 1 q n + 2 c f n + 2 q n + ( 1 ) n c n ( a b c ) ,
b a ζ ( m + 1 ) ζ ( n ) f m q m + n = d f 2 m + n ( 1 ) m c m d f n ,
b a ζ ( m ) ζ ( n ) f m + n q n = d f m + 2 n + ( 1 ) m c n d f m .
Consider the sequence { g n } defined by
g 0 = 2 , g 1 = b , g n = a g n 1 + c g n 2 , if     n     is     even b g n 1 + c g n 2 , if     n     is     odd ( n 2 ) .
Recently Tan and Leung [18] studied the properties of the bi-periodic Fibonacci and Lucas sequences, and stated that the following identities can be obtained using matrix method in [19]:
f m g n + f n g m = 2 b a ζ ( m ) ζ ( n ) f m + n ,
g m g n + b ( a b + 4 c ) a f m f n = 2 b a ζ ( m ) ζ ( n ) g m + n ,
f m g n f n g m = ( 1 ) n 2 c n b a ζ ( m ) ζ ( n ) f m n ,
g m g n b ( a b + 4 c ) a f m f n = ( 1 ) n 2 c n b a ζ ( m ) ζ ( n ) g m n ,
f m + n + ( 1 ) n c n f m n = a b ζ ( m ) ζ ( n ) f m g n ,
g m + n + ( 1 ) n c n g m n = a b ζ ( m ) ζ ( n ) g m g n .
In fact more general identities than (31)–(36) can be obtained using the results of this paper. To show this, consider the sequence { g ^ n } defined by
g ^ 0 = 2 d , g ^ 1 = b d , g ^ n = a g ^ n 1 + c g ^ n 2 , if     n     is     even b g ^ n 1 + c g ^ n 2 , if     n     is     odd ( n 2 ) .
Since { g ^ n } is obtained from (4) by exchanging the roles of a and b, the Binet’s formula is given by
g ^ n = d ( a b ) n 2 a ζ ( n ) ( α n + β n ) ,
where α and β are as defined in (6), and we have
q n = a b ζ ( n ) g ^ n .
Now, inserting (39) into (11), we have
b a ζ ( m + 1 ) ζ ( n ) ζ ( n ) f m g ^ n + b a ζ ( m ) ζ ( n + 1 ) ζ ( m ) f n g ^ m = b a ζ ( m ) ζ ( n ) ( f m g ^ n + f n g ^ m ) = 2 d f m + n ,
and so
f m g ^ n + f n g ^ m = 2 d b a ζ ( m ) ζ ( n ) f m + n .
Similarly, from (12)–(14), (19) and (20), we obtain the following identities:
g ^ m g ^ n + b d 2 ( a b + 4 c ) a f m f n = 2 d b a ζ ( m ) ζ ( n ) g ^ m + n ,
f m g ^ n f n g ^ m = ( 1 ) n 2 c n d b a ζ ( m ) ζ ( n ) f m n ,
g ^ m g ^ n b d 2 ( a b + 4 c ) a f m f n = ( 1 ) n 2 c n d b a ζ ( m ) ζ ( n ) g ^ m n ,
d f m + n + ( 1 ) n c n f m n = a b ζ ( m ) ζ ( n ) f m g ^ n ,
d g ^ m + n + ( 1 ) n c n g ^ m n = a b ζ ( m ) ζ ( n ) g ^ m g ^ n .
If d = 1 , then g ^ n = g n and (40)–(45) respectively reduce to (31)–(36).

3. Discussion

In this paper we considered two kinds of general sequences, i.e., generalized bi-periodic Fibonacci sequence and generalized bi-periodic Lucas sequence. The generalized bi-periodic Fibonacci sequence includes many sequences as special cases. For example, the Fibonacci, Pell and Jacobsthal sequences and the sequence of balancing numbers are particular examples. Also the generalized bi-periodic Lucas sequence include the Lucas, Pell-Lucas and Jacobsthal-Lucas sequences and the sequence of Lucas-balancing numbers as special cases.
We derived many interesting relations between these two sequences. The relations obtained in the paper not only include many existing one as special cases but also give diverse new results.

Funding

This research received no external funding.

Conflicts of Interest

The author declares no conflict of interest.

References

  1. Koshy, T. Fibonacci and Lucas Numbers with Applications; Wiley: New York, NY, USA, 2001. [Google Scholar]
  2. Edson, M.; Yayenie, O. A new generalization of Fibonacci sequence and extended Binet’s formula. Integers 2009, 9, 639–654. [Google Scholar] [CrossRef]
  3. Falcon, S.; Plaza, A. On the Fibonacci k-numbers. Chaos Solitons Fractals 2007, 32, 1615–1624. [Google Scholar] [CrossRef]
  4. Bilgici, G. Two generalizations of Lucas sequence. Appl. Math. Comput. 2014, 245, 526–538. [Google Scholar] [CrossRef]
  5. Falcon, S. On the k-Lucas numbers. Int. J. Contemp. Math. Sci. 2011, 6, 1039–1050. [Google Scholar]
  6. Catarino, P. On some identities and generating functions for k-Pell numbers. Int. J. Math. Anal. 2013, 7, 1877–1884. [Google Scholar] [CrossRef]
  7. Jhala, D.; Sisodiya, K.; Rathore, G.P.S. On some identities for k-Jacobsthal numbers. Int. J. Math. Anal. 2013, 7, 551–556. [Google Scholar] [CrossRef] [Green Version]
  8. Uygun, Ş. The (s,t)-Jacobsthal and (s,t)-Jacobsthal Lucas sequences. Appl. Math. Sci. 2015, 9, 3467–3476. [Google Scholar] [CrossRef] [Green Version]
  9. Behera, A.; Panda, G.K. On the square roots of triangular numbers. Fibonacci Quart. 1999, 37, 98–105. [Google Scholar]
  10. Tasci, D.; Sevgi, E. Bi-periodic balancing numbers. J. Sci. Arts 2020, 50, 75–84. [Google Scholar]
  11. Catarino, P.; Vasco, P. On some identities and generating functions for k-Pell-Lucas sequence. Appl. Math. Sci. 2013, 7, 4867–4873. [Google Scholar] [CrossRef] [Green Version]
  12. Campos, H.; Catarino, P.; Aires, A.P.; Vasco, P.; Borges, A. On some identities of k-Jacobsthal-Lucas numbers. Int. J. Math. Anal. 2014, 8, 489–494. [Google Scholar] [CrossRef] [Green Version]
  13. Uygun, S.; Karatas, H. A new generalization of Pell-Lucas numbers (bi-periodic Pell-Lucas sequence). Commun. Math. Appl. 2019, 10, 469–479. [Google Scholar] [CrossRef]
  14. Uygun, S.; Owusu, E. A new generalization of Jacobsthal Lucas numbers (bi-periodic Jacobsthal Lucas sequence). J. Adv. Math. Comput. Sci. 2019, 34, 1–13. [Google Scholar] [CrossRef] [Green Version]
  15. Panda, G.K. Some fascinating properties of balancing numbers. Proc. Elev. Int. Conf. Fibonacci Numbers Their Appl. Congr. Numer. 2009, 194, 185–189. [Google Scholar]
  16. Yayenie, O. A note on generalized Fibonacci sequences. Appl. Math. Comput. 2011, 217, 5603–5611. [Google Scholar] [CrossRef]
  17. Choo, Y. On the generalized bi-periodic Lucas quaternions. Int. J. Math. Anal. 2020, 14, 137–145. [Google Scholar] [CrossRef]
  18. Tan, E.; Leung, H. Some basic properties of the generalized bi-periodic Fibonacci and Lucas sequences. Adv. Differ. Eqn. 2020, 26, 1–11. [Google Scholar] [CrossRef]
  19. Tan, E. On bi-periodic Fibonacci and Lucas numbers by matrix method. Ars Comb. 2017, 133, 107–113. [Google Scholar]

Share and Cite

MDPI and ACS Style

Choo, Y. Relations between Generalized Bi-Periodic Fibonacci and Lucas Sequences. Mathematics 2020, 8, 1527. https://doi.org/10.3390/math8091527

AMA Style

Choo Y. Relations between Generalized Bi-Periodic Fibonacci and Lucas Sequences. Mathematics. 2020; 8(9):1527. https://doi.org/10.3390/math8091527

Chicago/Turabian Style

Choo, Younseok. 2020. "Relations between Generalized Bi-Periodic Fibonacci and Lucas Sequences" Mathematics 8, no. 9: 1527. https://doi.org/10.3390/math8091527

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