Bulletin of Mathematics

Vol. 08, No. 02 (2016), pp. 159–168.

A NEW RELATION BETWEEN THE

FIBONACCI AND LUCAS SEQUENCES FOR
7-STEP

M. R. Fadhilla, S. Gemawati, I. Hasbiyati

and M. D. H. Gamal

Abstract. This article discusses a relation of Fibonacci and Lucas sequences

having seven order. This formula is used to determine the kth term of Lucas 7
step. This paper uses the method of Natividad and Policarpio [General Mathe-
matics Notes, 7 (2013), 82–87] and applies mathematical induction to prove the
formula. The result indicates that every variable of Lucas 7 step forms Fibonacci
7 step. It can be concluded that to determine kth term of Lucas 7 step can be ob-
tained by summing up multiplication of the first seventh term of Lucas 7 step and
corresponding Fibonacci 7 step.

1 INTRODUCTION
The Fibonacci sequence (Fn ) is recursive sequence obtained by summing up
previous two numbers. This sequence has experience expansion by many
researchers. The expansion is done not limited to the formula of finding
Fibonacci sequence, but also is developed to Fibonacci like sequence.
The Fibonacci sequence is not the only sequence obtained by summing
up previous two numbers. Similar to Fibonacci is called Lucas sequence
(Ln ). The difference of both sequences lay in initial conditions, that is
Received 30-11-2016, Accepted 23-12-2016.
2010 Mathematics Subject Classification: 11B39
Key words and Phrases: Fibonacci sequence, Lucas sequence, Fibonacci n step, Lucas n step.

159
M. R. Fadhilla, S. Gemawati, I. Hasbiyati & M. D. H. Gamal – The Formula Lucas 7 Step 160

F0 = 0, F1 = 1 and L0 = 2, L1 = 1. Many researchers study relationship

of these sequences. Benyamin and Quinn [2] find identity of the relation
of Fibonacci and Lucas sequences. Parindeni and Gemawati [5] find the
formula for Lucas like sequence of fourth step and fifth step. Azarian [1] also
finds the relation of Fibonacci and Lucas sequences for binomial quantifying
identity.
Tony and Post [4] study the identity of the relation of Fibonacci and
Lucas sequences having order n equivalent to the relation of recursive of the
following
(n) (n) (n)
Fk+1 = 2Fk − Fk−n ,
(n) (n) (n)
Lk+1 = 2Lk − Lk−n ,
(n) (n) (n) (n) (n)
Lk = Fk + 2Fk−1 + · · · + (n − 1)Fk−n+2 + nFk−n+1 .

2 FIBONACCI n STEP AND LUCAS n STEP

The following gives by definition of Fibonacci n step and Lucas n step and
some examples of it.
(n)
Definition 2.1 The Fibonacci n step (Fk ) defined as formula linear re-
cursive is having order n > 1:
(n) (n) (n) (n)
Fk+1 = Fk + Fk−1 + · · · + Fk−n+1 , (1)

(n) (n)
where F1 = 1, Fk = 0, k = −n + 2, · · · , 0.

(n)
Definition 2.2 The Lucas n step (Lk ) defined as formula linear recursive
is having order n > 1:
(n) (n) (n) (n)
Lk = Lk−1 + Lk−2 + ... + Lk−n , (2)

(n) (n)
where L0 = n and Lk = −1 for k = −n + 1, · · · , −1.

Based on equation (1) and equation (2), the example for Fibonacci n step
and Lucas n step for 2 ≤ n ≤ 7 can be showed in Table 1 and Table 2.
M. R. Fadhilla, S. Gemawati, I. Hasbiyati & M. D. H. Gamal – The Formula Lucas 7 Step 161

Table 1: The Fibonacci n step sequences

k 1 2 3 4 5 6 7 8 9 10 11 12 13 14
n
2 1 1 2 3 5 8 13 21 34 55 89 144 233 377
3 1 1 2 4 7 13 24 44 81 149 274 504 927 1705
4 1 1 2 4 8 15 29 56 108 208 401 773 1490 2872
5 1 1 2 4 8 16 31 61 120 236 465 912 1793 3525
6 1 1 2 4 8 16 32 63 125 248 492 976 1936 3840
7 1 1 2 4 8 16 32 64 127 253 504 1004 2000 3984

Table 2: The Lucas n step sequences

k 1 2 3 4 5 6 7 8 9 10 11 12 13
2 1 3 4 7 11 18 29 47 76 123 199 322 521
3 1 3 7 11 21 39 71 131 241 443 815 1499 2757
4 1 3 7 15 26 51 99 191 367 708 1365 2631 5071
5 1 3 7 15 31 57 113 223 439 863 1695 3333 6553
6 1 3 7 15 31 63 120 239 475 943 1871 3711 7359
7 1 3 7 15 31 63 127 247 493 983 1959 3903 7775

Parindeni and Gemawati [5] find a new formula to determine the kth
(4)
term of Lucas 4 step (Ln ). The formula obtained uses the method of
Natividad dan Policarpio [3]. By [5, Theorem 1] for every Lucas sequence
(4) (4) (4) (4)
L1 ,L2 ,L3 and L4 applies
(4) ∗ ∗ (4) ∗ ∗ ∗ (4)
Lk =(Mk−2 )L1 + (Mk−2 + Mk−3 )L2 + (Mk−2 + Mk−3
∗ (4)
∗ ∗ ∗ ∗ (4)
+ Mk−4 )L3 + (Mk−2 + Mk−3 + Mk−4 + Mk−5 )L4 .

In this paper, we study a new relationship of Fibonacci and Lucas

sequences for seventh order so that the formula is applicable to determine
kth term of Lucas sequence for seventh order.

3. A NEW RELATION THE FIBONACCI AND LUCAS FOR

SEVENTH ORDER

Furthermore we give the expansion process of the relation of Fibonacci 7

step and Lucas 7 step. To find the relation it starts by analysing some
equations of Lucas 7 step obtained from equation (2) for 8 ≤ k ≤ 15 and
M. R. Fadhilla, S. Gemawati, I. Hasbiyati & M. D. H. Gamal – The Formula Lucas 7 Step 162

n = 7 as follows:
(7) (7) (7) (7) (7) (7) (7) (7)

L8 = L1 + L2 + L3 + L4 + L5 + L6 + L7 

(7) (7) (7) (7) (7) (7) (7) (7)

L9 = L1 + 2L2 + 2L3 + 2L4 + 2L5 + 2L6 + 2L7




(7) (7) (7) (7) (7) (7) (7) (7) 
L10 = 2L1 + 3L2 + 4L3 + 4L4 + 4L5 + 4L6 + 4L7




(7) (7) (7) (7) (7) (7) (7) (7) 
L11 = 4L1 + 6L2 + 7L3 + 8L4 + 8L5 + 8L6 + 8L7

(7) (7) (7) (7) (7) (7) (7) (7)
L12 = 8L1 + 12L2 + 14L3 + 15L4 + 16L5 + 16L6 + 16L7 


(7) (7) (7) (7) (7) (7) (7) (7) 
L13 = 16L1 + 24L2 + 28L3 + 30L4 + 31L5 + 32L6 + 32L7 


(7) (7) (7) (7) (7) (7) (7) (7)


L14 = 32L1 + 48L2 + 56L3 + 60L4 + 62L5 + 63L6 + 64L7 


(7) (7) (7) (7) (7) (7) (7) (7)

L15 = 64L1 + 96L2 + 112L3 + 120L4 + 124L5 + 126L6 + 127L7

(3)

(7) (7) (7) (7) (7) (7)

Based on equation (3), coefficients of L1 , L2 , L3 , L4 , L5 , L6 and
(7)
L7 for 8th until kth are presented in Table 3.

(7) (7) (7) (7) (7) (7) (7)

Table 3: Coefficient arrangements of L1 ,L2 ,L3 ,L4 ,L5 ,L6 ,L7

(7)
k Lk Coefficients
(7) (7) (7) (7) (7) (7) (7)
L1 L2 L3 L4 L5 L6 L7
(7)
8 L8 1 1 1 1 1 1 1
(7)
9 L9 1 2 2 2 2 2 2
(7)
10 L10 2 3 4 4 4 4 4
(7)
11 L11 4 6 7 8 8 8 8
(7)
12 L12 8 12 14 15 16 16 16
(7)
13 L13 16 24 28 30 31 32 32
(7)
14 L13 32 48 56 60 62 63 64
(7)
15 L13 64 96 112 120 124 126 127
.. .. .. .. .. .. .. .. ..
. . . . . . . . .
(7) (7) P8 (7) P9 (7) P10 (7) P11 (7) P12 (7) (7)
k Lk Fk−7 i=7 Fk−i i=7 Fk−i i=7 Fk−i i=7 Fk−i i=7 Fk−i Fk−8

(7) (7) (7)

From Table 3 it can be showed that the coefficients of L1 , L2 , L3 ,
(7) (7) (7) (7)
L4 , L5 , L6 and L7 are Fibonacci 7 step as showed in Table 1 for n = 7.
(7)
The coefficient of L1 for the 8th term to 15th is the first eight term of the
(7) (7)
Fibonacci 7 step so that L1 for kth can be expressed as Fk−7 . Hereinafter
M. R. Fadhilla, S. Gemawati, I. Hasbiyati & M. D. H. Gamal – The Formula Lucas 7 Step 163

(6)
the coefficient of L2 for 9th is summing up the 8th and 9th the coefficient
(7) (7) (7)
L1 , and L2 for 10th is summing up 9th and dan 10th the coefficient L1 ,
(7) (7) (7)
so that the coefficient of kth term of L2 can be expresed as Fk−7 + Fk−8
P8 (7)
or i=7 Fk−i .
(7)
Hereinafter the coefficient of L3 for 10th is summing up 8th, 9th and
(7) (7)
10th from the coefficent L1 and the coefficient of L3 for 11th is summing
(7)
up the 9th, 10th and 11th term coeficient of L1 , so that the coefficient of
(7) (7) (7) (7) (6)
kth term of L3 can be expressed as Fk−7 + Fk−8 + Fk−9 or 9i=7 Fk−i . The
P
(7) (7)
pattern continues until L6 . While the pattern of coefficient L7 for 8th to
(7)
kth are corresponding Fk−6 .
(7)
From visible above observation that coefficient of L1 is corresponding
(7) (7) (7) (7) (7) (7) (7) (7)
to Fk−7 , L2 to 8i=7 Fk−i , L3 to 9i=7 Fk−i , L4 to 10
P P P
i=7 Fk−i , L5 to
P11 (6) (7) P12 (7) (7) (7)
i=7 Fk−i , L6 to i=7 Fk−i and L7 to Fk−6 . So that we obtain the
relation of Fibonacci 7 step and Lucas 7 step as follows:
(7) (7) (7) (7) (7) (7) (7)
Theorem 2.1 For every L1 , L2 , L3 , L4 , L5 , L6 , L7 are Lucas 7
step, the formula to determine the k-th term of Lucas n step is
8
X  9
X  10
X 
(7) (7) (7) (7) (7) (7) (7) (7) (7)
Lk =Fk−7 L1 + Fk−i L2 + Fk−i L3 + Fk−i L4
i=7 i=7 i=7
11
X  12
X 
(7) (7) (7) (7) (7) (7)
+ Fk−i L5 + Fk−i L6 + Fk−6 L7 , (4)
i=7 i=7

(7) (7) (7)

where Lk is the k-th term of Lucas 7 step,, L1 are the first, L2 is the
(7) (7) (7) (7) (7)
second, L3 is third, L4 is fourth, L5 is fifth L6 is sixth, L7 is seventh
(7) (7) (7) (7) (7) (7) (7)
and Fk−6 , Fk−7 ,Fk−8 ,Fk−9 ,Fk−10 ,Fk−11 , Fk−12 are corresponding Fibonacci
7 step.

Proof. The theorem is proved using the strong mathematical induction

for k ≥ 8 and k is some positive integers. Assume that k = 8 is bases, so
that we get
M. R. Fadhilla, S. Gemawati, I. Hasbiyati & M. D. H. Gamal – The Formula Lucas 7 Step 164

8
X  9
X  10
X 
(7) (7) (7) (7) (7) (7) (7) (7) (7)
L8 =F1 L1 + F8−i L2 + F8−i L3 + F8−i L4
i=7 i=7 i=7
11 12
(7) (7) (7) (7) (7) (7)
X X
+( F8−i )L5 + ( F8−i )L6 + F2 L7
i=7 i=7
(7) (7) (7) (7) (7)
L8 =(1)L1
+ (1 + 0)L2 + (1 + 0 + 0)L3 + (1 + 0 + 0 + 0)L4
(7) (7) (7)
+(1 + 0 + 0 + 0 + 0)L5 + 1 + 0 + 0 + 0 + 0 + 0)L6 + (1)L7
(7) (7) (7) (7) (7) (7) (7) (7)
L8 =L1 + L2 + L3 + L4 + L5 + L6 + L7 . (5)

Equation (5) is true from equation (2) for n = 7 and k = 8. Next assume
that the statement is true for k = 8, 9, 10, · · · , m − 6, m − 5, m − 4, m − 3,
m − 2, m − 1, m with m is some positive integers.

8
X  9
X  10
X 
(7) (7) (7) (7) (7) (7) (7) (7)
P (m) : L(7)
m =Fm−7 L1 + Fm−i L2 + Fm−i L3 + Fm−i L4
i=7 i=7 i=7
11
X  12
X 
(7) (7) (7) (7) (7) (7)
+ Fm−i L5 + Fm−i L6 + Fm−6 L7 , (6)
i=7 i=7

9
X  10
X 
(7) (7) (7) (7) (7) (7) (7)
P (m − 1) : Lm−1 =Fm−8 L1 + Fm−i L2 + Fm−i L3
i=8 i=8
11
X  12
X  13
X 
(7) (7) (7) (7) (7) (7)
+ Fm−i L4 + Fm−i L5 + Fm−i L6
i=8 i=8 i=8
(7) (7)
+Fm−7 L7 , (7)

10
X  11
X 
(7) (8) (8) (7) (7) (7) (7)
P (m − 2) : Lm−2 =Fm−9 L1 + Fm−i L2 + Fm−i L3
i=9 i=9
12
X  13
X  14
X 
(7) (7) (7) (7) (7) (7)
+ Fm−i L4 + Fm−i L5 + Fm−i L6
i=9 i=9 i=9
(7) (7)
+Fm−8 L7 , (8)
M. R. Fadhilla, S. Gemawati, I. Hasbiyati & M. D. H. Gamal – The Formula Lucas 7 Step 165

11
X  12
X 
(7) (7) (7) (7) (7) (7) (7)
P (m − 3) : Lm−3 =Fm−10 L1 + Fm−i L2 + Fm−i L3
i=10 i=10
13
X  14
X  15
X 
(7) (7) (7) (7) (7) (7)
+ Fm−i L4 + Fm−i L5 + Fm−i L6
i=10 i=10 i=10
(6) (7)
+Fm−9 L7 , (9)

12
X  13
X 
(7) (7) (7) (7) (7) (7) (7)
P (m − 4) : Lm−4 =Fm−11 L1 + Fm−i L2 + Fm−i L3
i=11 i=11
14
X  15
X  16
X 
(7) (7) (7) (7) (7) (7)
+ Fm−i L4 + Fm−i L5 + Fm−i L6
i=11 i=11 i=11
(6) (7)
+Fm−10 L7 , (10)

13
X  14
X 
(7) (7) (7) (7) (7) (7) (7)
P (m − 5) : Lm−5 =Fm−12 L1 + Fm−i L2 + Fm−i L3
i=12 i=12
15
X  16
X  17
X 
(7) (7) (7) (7) (7) (7)
+ Fm−i L4 + Fm−i L5 + Fm−i L6
i=12 i=12 i=12
(6) (7)
+Fm−11 L7 , (11)

14
X  15
X 
(7) (7) (7) (7) (7) (7) (7)
P (m − 6) : Lm−6 =Fm−13 L1 + Fm−i 2 + Fm−i L3
i=13 i=13
16
X  17
X  18
X 
(7) (7) (7) (7) (7) (7)
+ Fm−i L4 + Fm−i L5 + Fm−i L6
i=13 i=13 i=13
(6) (7)
+Fm−12 L7 . (12)
Next P (m + 1) is proved true if P (m), P (m − 1), P (m − 2), P (m − 3),
P (m − 4), P (m − 5), P (m − 6), · · · , 10, 9, 8 are true, that is
X 7  X 8 
(7) (7) (7) (7) (7) (7) (7)
P (m + 1) : Lm+1 =Fm−6 L1 + Fm−i L2 + Fm−i L3
i=6 i=6
9
X  10
X  11
X 
(7) (7) (7) (7) (7) (7)
+ Fm−i L4 + Fm−i L5 + Fm−i L6
i=6 i=6 i=6
(7) (7)
+Fm−5 L7 . (13)
M. R. Fadhilla, S. Gemawati, I. Hasbiyati & M. D. H. Gamal – The Formula Lucas 7 Step 166

To prove equation ( 13), both sides of equation (6) are summing up with
(7) (7) (7) (7) (7) (7)
Lm−1 , Lm−2 , Lm−3 , Lm−4 , Lm−5 and Lm−6 , so that equation (6) becomes

(7) (7) (7) (7) (7) (7) (7) (7)

L(7)
m + Lm−1 +Lm−2 + Lm−3 + Lm−4 + Lm−5 + Lm−6 = Fm−7 L1
X8  X 9  X10 
(7) (7) (7) (7) (7) (7)
+ Fm−i L2 + Fm−i L3 + Fm−i L4
i=7 i=7 i=7
11
X  12
X 
(7) (7) (7) (7) (7) (7) (7)
+ Fm−i L5 + Fm−i L6 + Fm−6 L7 + Lm−1
i=7 i=7
(7) (7) (7) (7) (7)
+Lm−2 + Lm−3 + Lm−4 + Lm−5 + Lm−6 . (14)

Hereinafter substituting of equations (7), (8), (9), (10), (11) and (12)
into equation (14) we obtain
8
X  9
X  10
X 
(7) (7) (7) (7) (7) (7) (7) (7) (7)
Lm+1 =Fm−7 L1 + Fm−i L2 + Fm−i L3 + Fm−i L4
i=7 i=7 i=7
11
X  12
X  
(7) (7) (7) (7) (7) (7) (7) (7)
+ Fm−i L5 + Fm−i L6 + Fm−6 L7 + Fm−8 L1
i=7 i=7
9
X  10
X  11
X 
(7) (7) (7) (7) (7) (7)
+ Fm−i L2 + Fm−i L3 + Fm−i L4
i=8 i=8 i=8
12
X  13
X   
(7) (7) (7) (7) (7) (7) (8) (8)
+ Fm−i L5 + Fm−i L6 + Fm−7 L7 + Fm−9 L1
i=8 i=8
10
X  11
X  12
X 
(7) (7) (7) (7) (7) (7)
+ Fm−i L2 + Fm−i L3 + Fm−i L4
i=9 i=9 i=9
13
X  14
X   
(7) (7) (7) (7) (7) (7) (7) (7)
+ Fm−i L5 + Fm−i L6 + Fm−8 L7 + Fm−10 L1
i=9 i=9
11
X  12
X  13
X 
(7) (7) (7) (7) (7) (7)
+ Fm−i L2 + Fm−i L3 + Fm−i L4
i=10 i=10 i=10
14
X  15
X   
(7) (7) (7) (7) (7) (7) (7) (7)
+ Fm−i L5 + Fm−i L6 + Fm−9 L7 + Fm−11 L1
i=10 i=10
M. R. Fadhilla, S. Gemawati, I. Hasbiyati & M. D. H. Gamal – The Formula Lucas 7 Step 167

12
X  13
X  14
X 
(7) (7) (7) (7) (7) (7)
+ Fm−i L2 + Fm−i L3 + Fm−i L4
i=11 i=11 i=11
15
X  16
X   
(7) (7) (7) (7) (6) (7) (7) (7)
+ Fm−i L5 + Fm−i L6 + Fm−10 L7 + Fm−12 L1
i=11 i=11
13
X  14
X  15
X 
(7) (7) (7) (7) (7) (7)
+ Fm−i L2 + Fm−i L3 + Fm−i L4
i=12 i=12 i=12
16
X  17
X   
(7) (7) (7) (7) (6) (7) (7) (7)
+ Fm−i L5 + Fm−i L6 + Fm−11 L7 + Fm−13 L1
i=12 i=12
14
X  15
X  16
X 
(7) (7) (7) (7) (7) (7)
+ Fm−i 2 + Fm−i L3 + Fm−i L4
i=13 i=13 i=13
17
X  18
X  
(7) (7) (7) (7) (6) (7)
+ Fm−i L5 + Fm−i L6 + Fm−12 L7 . (15)
i=13 i=13

Next the equation (15) can be made as

13
X  13
X 14  13
X
(7) (7) (7) (7) (7) (7) (7)
X
Lm+1 = Fm−i L1 + Fm−i + Fm−1 L2 + Fm−i
i=7 i=7 i=8 i=7
14 15  13
X 14 15
(7) (7) (7) (7) (7) (7)
X X X X
+ Fm−1 + Fm−i L3 + Fm−i + Fm−1 + Fm−i
i=8 i=9 i=7 i=8 i=9
16  13
X 14 15 16
(7) (7) (7) (7) (7) (7)
X X X X
+ Fm−i L4 + Fm−i + Fm−1 + Fm−i + Fm−i
i=10 i=7 i=8 i=9 i=10
17  13
X 14 15 16
(7) (7) (7) (7) (7) (7)
X X X X
+ Fm−i L5 + Fm−i + Fm−1 + Fm−i + Fm−i
i=11 i=7 i=8 i=9 i=10
17 18  12
X 
(7) (7) (7) (7) (7)
X X
+ Fm−i + Fm−i L6 + Fm−i L7 (16)
i=11 i=12 i=6

From (1) for n = 7, it is obtained that

7
X  8
X  9
X 
(7) (7) (7) (7) (7) (7) (7) (7) (7)
Lm+1 =Fm−6 L1 + Fm−i L2 + Fm−i L3 + Fm−i L4
i=6 i=6 i=6
10
X  11
X 
(7) (7) (7) (7) (7) (7)
+ Fm−i L5 + Fm−i L6 + Fm−5 L7 .
i=6 i=6
M. R. Fadhilla, S. Gemawati, I. Hasbiyati & M. D. H. Gamal – The Formula Lucas 7 Step 168

The last statement is an analogical correctness from (13) so that

P (m + 1) is correct. So the proof follows.

REFERENCES

1. M. K. Azarian, Identities involving Lucas or Fibonacci and Lucas numbers

as binomial sums, International Journal of Contemporary Mathematical
Sciences, 7 (2012), 2221–2227.
2. A. T. Benjamin dan J.J Quinn, Recounting Fibonacci and Lucas identities,
The College Mathematics Journal, 30 (1999), 359–366.
3. L. R. Natividad and P. B. Policarpio, A novel formula in solving tribonacci-
like sequence, General Mathematics Notes, N.7, 2013, pp.82–87.
4. T. D. Noe dan J. V. Post, Primes in Fibonacci n step and Lucas n step
sequences, Journal of Integer Sequences, 8 (2005), 1–12.
5. R. Parindeni dan S. Gemawati, Formula for Lucas Like Sequence of Fourth
Step and Fifth Step, International Mathematical Forum, 12 (2017), 103–
110.

Mushbar Rabby Fadhilla: Master’s Student, Department of Mathematics, Fac-

ulty of Mathematics and Natural Sciences, University of Riau, Bina Widya Campus,
Pekanbaru 28293, Indonesia.
E-mail: mushbar.fadhilla@gmail.com

Sri Gemawati: Department of Mathematics, Faculty of Mathematics and Natural

Sciences, University of Riau, Bina Widya Campus, Pekanbaru 28293, Indonesia.
E-mail: gemawati.sri@gmail.com

Ihda Hasbiyati: Department of Mathematics, Faculty of Mathematics and Natural

Sciences, University of Riau, Bina Widya Campus, Pekanbaru 28293, Indonesia.
E-mail: ihdahasbiyati26@yahoo.com

M. D. H Gamal: Department of Mathematics, Faculty of Mathematics and Natural

Sciences, University of Riau, Bina Widya Campus, Pekanbaru 28293, Indonesia.
E-mail: mdhgamal@unri.ac.id