The complex pulsating 



(


a


1


,


a


2


,
…
,


a


m


,
c
)




-Fibonacci sequence

Prathomjit Khachorncharoenkul; Kiattiyot Phibul; Kittipong Laipaporn

doi:10.1016/j.jksus.2022.102063

View/Download PDF

Buy Reprints

PDF

Translate this page into:

Original article

07 2022

:34;

102063

doi:

10.1016/j.jksus.2022.102063

The complex pulsating $(a_{1}, a_{2}, \dots, a_{m}, c)$ -Fibonacci sequence

Prathomjit Khachorncharoenkul^{^a}, Kiattiyot Phibul^{^a}, Kittipong Laipaporn^{^a,⁎}

a School of Science, Walailak University, Nakhon Si Thammarat 80160, Thailand

⁎Corresponding author. lkittipo@wu.ac.th (Kittipong Laipaporn)

Received: 2021-10-13, Accepted: 2022-4-23,

Disclaimer:
This article was originally published by Elsevier and was migrated to Scientific Scholar after the change of Publisher.

Abstract

Several researchers have looked at pulsating Fibonacci sequences in the last ten years, which are generalizations of the Fibonacci sequence. They verify the closed form of these sequences via mathematical induction. This approach is beautiful, but it can only be utilized when patterns of the closed forms are predicted. In this paper, we introduce the complex pulsating $(a_{1}, a_{2}, \dots, a_{m}, c)$ -Fibonacci sequence and apply matrix theory, particularly eigenvalues, eigenvectors, and block matrices, as well as basic properties of the floor function to bridge the gap and obtain the closed form of the complex pulsating. Moreover, the golden ratios of this sequence are provided.

Keywords

Pulsating Fibonacci sequence

Golden ratio

Eigenvalue

Eigenvector

Block matrix

The floor function

11B39

11B83

15A21

15A23

1 Introduction and Literature Review

The Fibonacci sequence ${F_{n}}$ is defined as $F_{0} = 0, F_{1} = 1$ and $F_{n} = F_{n - 1} + F_{n - 2}$ for $n > 1$ , and Binet’s formulas for Fibonacci numbers are given by $F_{n} = \frac{Φ^{n} - ϕ^{n}}{Φ - ϕ} = \frac{Φ^{n} - ϕ^{n}}{\sqrt{5}}$ , where $Φ = \frac{1 + \sqrt{5}}{2} \approx 1.6180339887 \dots$ , namely, the golden ratio, and $ϕ = 1 - Φ$ . This sequence has been extended in various versions and has also been studied by many mathematicians. For example, Miles (1960) defined the k-generalized Fibonacci numbers $f_{j, k}$ by $f_{j, k} = 0, 0 ⩽ j ⩽ k - 2, f_{k - 1, k} = 1, f_{j k} = \sum_{n = 1}^{k} f_{j - n, k}, j ⩾ k .$

Horadam (1961) defined the generalized Fibonacci sequence by $H_{n} = H_{n - 1} + H_{n - 2}, n ⩾ 3, w i t h H_{1} = p, H_{2} = p + q$ where p and q are arbitrary integers. Kalman and Mena (2003) generalized the Fibonacci sequence by $F_{n} = {aF}_{n - 1} + {bF}_{n - 2}, n ⩾ 2, with F_{0} = 0, F_{1} = 1 .$

Gupta et al. (2012) defined the generalized Fibonacci sequence by $F_{k} = {pF}_{k - 1} + {qF}_{k - 2}, k ⩾ 2, with F_{0} = a, F_{1} = b$ where $p, q, a$ and b are positive integers. Wani et al. (2017) defined the generalized k-Fibonacci sequence ${S_{k, n}}$ by $S_{n} = {kS}_{k, n - 1} + S_{k, n - 2}, n ⩾ 2, w i t h S_{k, 0} = q, S_{k, 1} = q k$ where q and k are positive integers. Javaheri and Krylov (2020) generalized the Fibonacci sequence by $F_{n + 1} = {PF}_{n} - {QF}_{n - 1}, with F_{0} = 0, F_{1} = 1$ where P and Q are nonzero integers. However, Atanassov et al. (1985, 2001) defined four 2-Fibonacci sequences as follows: $α_{0} = a, β_{0} = b, α_{1} = c, β_{1} = d,$

(1.1)

\begin{matrix} α_{n + 2} = β_{n + 1} + β_{n}, \\ β_{n + 2} = α_{n + 1} + α_{n} \end{matrix}

(1.2)

\begin{matrix} α_{n + 2} = α_{n + 1} + β_{n}, \\ β_{n + 2} = β_{n + 1} + α_{n} \end{matrix}

(1.3)

\begin{matrix} α_{n + 2} = β_{n + 1} + α_{n}, \\ β_{n + 2} = α_{n + 1} + β_{n} \end{matrix}

(1.4)

\begin{matrix} α_{n + 2} = α_{n + 1} + α_{n}, \\ β_{n + 2} = β_{n + 1} + β_{n} \end{matrix}

for every nonnegative integer n. We observe that most of them are related to the form of single-line sequences except for the work of K. Atanassov is remarkable. So, it is the inspiration for us to study and ascertain the behavior of this particular sequence.

Atanassov (2013) extended his sequence (1.2) by establishing the $(a, b)$ -pulsated Fibonacci sequence, which is defined by

(1.5)

\begin{matrix} α_{0} = a, β_{0} = b, \\ α_{2 k + 1} = β_{2 k + 1} = α_{2 k} + β_{2 k}, \\ α_{2 k + 2} = α_{2 k + 1} + β_{2 k}, \\ β_{2 k + 2} = β_{2 k + 1} + α_{2 k} \end{matrix}

where

a, b \in R

and

k \in N \cup {0}

. One year later, he also proposed a generalized version of (1.5), so called the

(a_{1}, a_{2}, \dots, a_{m})

-pulsated Fibonacci sequence, which was published in Atanassov (2014) and is defined as follows:

(1.6)

\begin{matrix} α_{1, 0} = a_{1}, α_{2, 0} = a_{2}, \dots, α_{m, 0} = a_{m}, \\ α_{1, 2 k + 1} = α_{2, 2 k + 1} = \dots = α_{m, 2 k + 1} = \sum_{i = 1}^{m} α_{i, 2 k}, \end{matrix} α_{j, 2 k + 2} = α_{j, 2 k + 1} + α_{m - j + 1, 2 k}

for any nonnegative integers

j, k

, and m such that

a_{1}, a_{2}, \dots, a_{m} \in R

and

1 ⩽ j ⩽ m

. Moreover, the latest version of pulsating Fibonacci sequence was reported by Halici and Karatas (2019). They defined a new sequence, complex pulsating Fibonacci sequence, as follows:

(1.7)

\begin{matrix} P_{0} = a + ci, Q_{0} = b + ci, \\ Re (P_{n + 1}) = Im (P_{n}), Re (Q_{n + 1}) = Im (Q_{n}), \\ Im (P_{2 n + 2}) = Im (Q_{2 n + 2}) = Im (P_{2 n + 1} + Q_{2 n + 1}), \\ Im (P_{2 n + 1}) = Im (P_{2 n}) + Re (Q_{2 n}), \\ Im (Q_{2 n + 1}) = Im (Q_{2 n}) + Re (P_{2 n}) \end{matrix}

where

a, b

and c are real numbers and

n \in N \cup {0}

We note that it was sheer coincidence that the sequences in (1.1)-(1.7) were confirmed in their closed form by using mathematical induction.

In this paper, we use matrix theory, especially eigenvalues, eigenvectors and block matrices, and basic properties of the floor function to find the closed form of the Fibonacci sequence that merges (1.6) and (1.7), named the complex pulsating $(a_{1}, a_{2}, \dots, a_{m}, c)$ -Fibonacci sequence. This sequence is defined as follows: Let $a_{1}, a_{2}, \dots, a_{m}$ and c be real numbers. Then,

(1.8)

\begin{matrix} P_{1, 0} = a_{1} + ci, P_{2, 0} = a_{2} + ci, \dots, P_{m, 0} = a_{m} + ci, \\ Re (P_{j, k + 1}) = Im (P_{j, k}), \\ Im (P_{1, 2 k + 2}) = Im (P_{2, 2 k + 2}) = \dots = Im (P_{m, 2 k + 2}) = Im (\sum_{i = 1}^{m} P_{i, 2 k + 1}) \\ Im (P_{j, 2 k + 1}) = Im (P_{j, 2 k}) + Re (P_{m - j + 1, 2 k}), \end{matrix}

for all nonnegative integers

j, k

, and m such that and

1 ⩽ j ⩽ m

. To make it easier to visualize the complex pulsating

(a_{1}, a_{2}, \dots, a_{m}, c)

-Fibonacci sequence, we show in case m is equal to 2, that is equivalent to (1.7), as Fig. 1.

The complex pulsating ( a 1 , a 2 , c ) -Fibonacci sequence.

Outline of the paper. In Section 2, we give some results which affect the main obtained result. Section 3 is devoted to our main results. The complex pulsating $(a_{1}, a_{2}, \dots, a_{m}, c)$ -Fibonacci sequence is given in the closed form. Besides, the golden ratios of this sequence are investigated. Finally, in Section 4, we summarize and discuss our results.

2 Preliminaries

Throughout this paper, let $I_{m}$ be an m-by-m identity matrix and $J_{m}$ be an m-by-m matrix in which every entry is one. Let $K_{m}$ be an m-by-m reversal matrix that is a permutation matrix in which $k_{i, m - i + 1} = 1$ for $i = 1, 2, \dots, m$ and all other entries are zero.

In this section, to simplify the process of finding the closed form in Theorem 3.2, we construct the following lemmas.

Lemma 2.1

For any integer $m ⩾ 2$ , the eigenvalues of matrix $U = J_{m} + K_{m}$ are $m + 1$ of multiplicity 1, $- 1$ of multiplicity $⌊\frac{m}{2}⌋$ and 1 of multiplicity $⌊\frac{m - 1}{2}⌋$ . Moreover, the eigenvectors of matrix U are

${[1]}_{m \times 1}$ with eigenvalue $λ = m + 1$ ,
${[v^{h}]}_{m \times 1}$ with eigenvalue $λ = - 1$ for $h = 1, 2, \dots, ⌊\frac{m}{2}⌋$ , where $v_{i 1}^{h} = \{\begin{matrix} 1; i = h \\ - 1; i = m - h + 1 \\ 0; otherwise, \end{matrix}$
${[w^{h}]}_{m \times 1}$ with eigenvalue $λ = 1$ for $h = 1, 2, \dots, ⌊\frac{m - 1}{2}⌋$ , where if m is even, then $w_{i 1}^{h} = \{\begin{matrix} 1; i = h a n d i = m - h + 1 \\ - 1; i = \frac{m}{2} a n d i = \frac{m}{2} + 1 \\ 0; otherwise, \end{matrix}$ and if m is odd, then $w_{i 1}^{h} = \{\begin{matrix} 1; i = h a n d i = m - h + 1 \\ - 2; i = \frac{m + 1}{2} \\ 0; otherwise . \end{matrix}$

Proof

Obviously, by the properties of the floor function, we have $1 + ⌊\frac{m}{2}⌋ + ⌊\frac{m - 1}{2}⌋ = m .$ It is easily observed that $U {[1]}_{m \times 1} = [(m - 1) + 2] = (m + 1) {[1]}_{m \times 1};$ thus, $m + 1$ is the eigenvalue of the matrix U with the corresponding eigenvector ${[1]}_{m \times 1}$ .

Next, to show that $U [v^{h}] = - [v^{h}]$ for all $h \in {1, 2, \dots, ⌊\frac{m}{2}⌋}$ , let $U = [u_{ij}]$ and $z_{i}^{h}$ be the ith column of $U [v^{h}]$ . Then, $\begin{array}{l} z_{i}^{h} & = \sum_{j = 1}^{m} u_{ij} v_{j 1}^{h} = u_{ih} - u_{i, m - h + 1} = \{\begin{matrix} 2 - u_{m - h + 1, m - h + 1}; i = m - h + 1 \\ 1 - u_{i, m - h + 1}; i \neq m - h + 1 \end{matrix} \\ = \{\begin{matrix} 2 - 1; i = m - h + 1 \\ 1 - 2; i = h \\ 1 - 1; otherwise \end{matrix} = \{\begin{matrix} - 1; i = h \\ 1; i = m - h + 1 \\ 0; otherwise \end{matrix} = - v_{i 1}^{h} . \end{array}$

Finally, we show that $U [w^{h}] = [w^{h}]$ for all $h \in {1, 2, \dots, ⌊\frac{m - 1}{2}⌋}$ . Let $U = [u_{ij}]$ and $z_{i}^{h}$ be the ith column of $U [w^{h}]$ . If m is even, then $\begin{matrix} z_{i}^{h} & = \sum_{j = 1}^{m} u_{ij} w_{j 1}^{h} = u_{ih} + u_{i, m - h + 1} - u_{i, \frac{m}{2}} - u_{i, \frac{m}{2} + 1} \\ = \{\begin{matrix} 2 + u_{m - h + 1, m - h + 1} - u_{m - h + 1, \frac{m}{2}} - u_{m - h + 1, \frac{m}{2} + 1}; i = m - h + 1 \\ 1 + u_{i, m - h + 1} - u_{i, \frac{m}{2}} - u_{i, \frac{m}{2} + 1}; i \neq m - h + 1 \end{matrix} \\ = \{\begin{matrix} 2 + 1 - 1 - 1; i = m - h + 1 \\ 1 + 2 - 1 - 1; i = h \\ 1 + 1 - 1 - 2; i = \frac{m}{2} \\ 1 + 1 - 2 - 1; i = \frac{m}{2} + 1 \\ 1 + 1 - 1 - 1; otherwise \end{matrix} = \{\begin{matrix} 1; i = h or i = m - h + 1 \\ - 1; i = \frac{m}{2} or i = \frac{m}{2} + 1 \\ 0; otherwise \end{matrix} = w_{i 1}^{h} . \end{matrix}$

If m is odd, then $\begin{matrix} z_{i}^{h} & = \sum_{j = 1}^{m} u_{ij} w_{j 1}^{h} = u_{ih} + u_{i, m - h + 1} - 2 u_{i, \frac{m + 1}{2}} \\ = \{\begin{matrix} 2 + u_{m - h + 1, m - h + 1} - 2 u_{m - h + 1, \frac{m + 1}{2}}; i = m - h + 1 \\ 1 + u_{i, m - h + 1} - 2 u_{i, \frac{m + 1}{2}}; i \neq m - h + 1 \end{matrix} \\ = \{\begin{matrix} 2 + 1 - 2 (1); i = m - h + 1 \\ 1 + 2 - 2 (1); i = h \\ 1 + 1 - 2 (2); i = \frac{m + 1}{2} \\ 1 + 1 - 2 (1); otherwise \end{matrix} = \{\begin{matrix} 1; i = h or i = m - h + 1 \\ - 2; i = \frac{m + 1}{2} \\ 0; otherwise \end{matrix} = w_{i 1}^{h} . \end{matrix}$ Hence, we have the desired result.

Lemma 2.2

Let U be the matrix which defined in Lemma 2.1 and $n \in N$ . Then, $U^{n} = {xJ}_{m} + I_{m}$ when n is even, and $U^{n} = {xJ}_{m} + K_{m}$ when n is odd, where $x = \frac{{(m + 1)}^{n} - 1}{m}$ .

Proof

By Lemma 2.1, we know that $U^{n} = {PD}^{n} P^{- 1}$ , where P is an m-by-m matrix such that each column vector is an eigenvector of U associated with the eigenvalues $m + 1, - 1$ and 1 and $D = diag (m + 1, \underset{⌊\frac{m}{2}⌋}{\underset{⏟}{- 1, \dots, - 1}}, \underset{⌊\frac{m - 1}{2}⌋}{\underset{⏟}{1, \dots, 1}})$ . To understand the following process more easily, we separate the proof into two cases.

Case 1 If m is odd, then it is easily found that $⌊\frac{m - 1}{2}⌋ = r = ⌊\frac{m}{2}⌋$ , where $m = 2 r + 1$ . A useful expression for the correspondingly partitioned presentation of m-by-m matrices $P, D^{n}$ and $P^{- 1}$ is $P = [\begin{matrix} {[1]}_{r \times 1} & I_{r} & I_{r} \\ 1 & 0_{1 \times r} & {[- 2]}_{1 \times r} \\ {[1]}_{r \times 1} & - K_{r} & K_{r} \end{matrix}], D^{n} = [\begin{matrix} {(m + 1)}^{n} & 0_{1 \times r} & 0_{1 \times r} \\ 0_{r \times 1} & {(- 1)}^{n} I_{r} & 0_{r} \\ 0_{r \times 1} & 0_{r} & I_{r} \end{matrix}]$ and $P^{- 1} = [\begin{matrix} {[\frac{1}{m}]}_{1 \times r} & \frac{1}{m} & {[\frac{1}{m}]}_{1 \times r} \\ \frac{1}{2} I_{r} & 0_{r \times 1} & - \frac{1}{2} K_{r} \\ \frac{1}{2} I_{r} - \frac{1}{m} J_{r} & {[- \frac{1}{m}]}_{r \times 1} & \frac{1}{2} K_{r} - \frac{1}{m} J_{r} \end{matrix}] .$

We know that $JK = J = KJ$ and $K^{2} = I$ . Let $x = \frac{{(m + 1)}^{n} - 1}{m}$ . Then, by carrying out a partitioned multiplication and then simplifying, we write $U^{n}$ as follows: $U^{n} = [\begin{matrix} U_{1} & U_{2} & U_{3} \\ U_{4} & U_{5} & U_{4} \\ U_{3} & U_{2} & U_{1} \end{matrix}]$ where $\begin{matrix} U_{1} = {[\frac{1}{m} {(m + 1)}^{n}]}_{r} + \frac{{(- 1)}^{n}}{2} I_{r} + \frac{1}{2} I_{r} - \frac{1}{m} J_{r} = {xJ}_{r} + (\frac{{(- 1)}^{n} + 1}{2}) I_{r}, \\ U_{2} = {[\frac{1}{m} {(m + 1)}^{n}]}_{r \times 1} + {[- \frac{1}{m}]}_{r \times 1} = {[x]}_{r \times 1}, \\ U_{3} = {[\frac{1}{m} {(m + 1)}^{n}]}_{r} + \frac{{(- 1)}^{n + 1}}{2} K_{r} + \frac{1}{2} K_{r} - \frac{1}{m} J_{r} = {xJ}_{r} + (\frac{{(- 1)}^{n + 1} + 1}{2}) K_{r}, \\ U_{4} = {[\frac{1}{m} {(m + 1)}^{n}]}_{1 \times r} + {[- 1]}_{1 \times r} + {[\frac{2 r}{m}]}_{1 \times r} = {[\frac{{(m + 1)}^{n} + 2 r}{m} - 1]}_{1 \times r} = {[x]}_{1 \times r}, \\ U_{5} = \frac{1}{m} {(m + 1)}^{n} + \frac{2 r}{m} = x + 1 . \end{matrix}$

Then, we can rewrite $U^{n} = {xJ}_{m} + (\frac{{(- 1)}^{n} + 1}{2}) I_{m} + (\frac{{(- 1)}^{n + 1} + 1}{2}) K_{m}$ to conclude that if n is even, then $U^{n} = {xJ}_{m} + I_{m}$ , and if n is odd, then $U^{n} = {xJ}_{m} + K_{m}$ .

Case 2 If m is even, then it is easy to see that $⌊\frac{m - 1}{2}⌋ = r$ and $⌊\frac{m}{2}⌋ = r + 1$ , where $m = 2 (r + 1)$ . By the same argument as in Case 1, we obtain the matrix $U^{n}$ , where $P = [\begin{matrix} {[1]}_{r \times 1} & I_{r} & 0_{r \times 1} & I_{r} \\ {[1]}_{2 \times 1} & 0_{2 \times r} & [\begin{matrix} 1 \\ - 1 \end{matrix}] & {[- 1]}_{2 \times r} \\ {[1]}_{r \times 1} & - K_{r} & 0_{r \times 1} & K_{r} \end{matrix}], D^{n} = [\begin{matrix} {(m + 1)}^{n} & 0_{1 \times r} & 0 & 0_{1 \times r} \\ 0_{r \times 1} & {(- 1)}^{n} I_{r} & 0_{r \times 1} & 0_{r} \\ 0 & 0_{1 \times r} & {(- 1)}^{n} & 0_{1 \times r} \\ 0_{r \times 1} & 0_{r} & 0_{r \times 1} & I_{r} \end{matrix}]$ and $P^{- 1} = [\begin{matrix} {[\frac{1}{m}]}_{1 \times r} & {[\frac{1}{m}]}_{1 \times 2} & {[\frac{1}{m}]}_{1 \times r} \\ \frac{1}{2} I_{r} & 0_{r \times 2} & - \frac{1}{2} K_{r} \\ 0_{1 \times r} & [\begin{matrix} \frac{1}{2} & - \frac{1}{2} \end{matrix}] & 0_{1 \times r} \\ \frac{1}{2} I_{r} - \frac{1}{m} J_{r} & {[- \frac{1}{m}]}_{r \times 2} & \frac{1}{2} K_{r} - \frac{1}{m} J_{r} \end{matrix}] .$ we can rewrite $U^{n} = {xJ}_{m} + (\frac{{(- 1)}^{n} + 1}{2}) I_{m} + (\frac{{(- 1)}^{n + 1} + 1}{2}) K_{m}$ and hence, if n is even, then $U^{n} = {xJ}_{m} + I_{m}$ , and if n is odd, then $U^{n} = {xJ}_{m} + K_{m}$ , where $x = \frac{{(m + 1)}^{n} - 1}{m}$ , as desired.

3 Main results

Two portions are divided in this section. The closed form of the complex pulsating $(a_{1}, a_{2}, \dots, a_{m}, c)$ -Fibonacci sequence, which is the focus of the study, is demonstrated in the first section. The golden ratios of this sequence are discussed in the second half.

3.1

3.1 The closed form of the complex pulsating $(a_{1}, a_{2}, \dots, a_{m}, c)$ -Fibonacci sequence

In this section, matrix theory is an essential proof technique. We will reveal the reasoning behind this choice in Section 4. However, to visualize it more clearly, we would like to provide an example of the following sequence.

Example 3.1

In the circumstances $m = 4, a_{1} = 1, a_{2} = 2, a_{3} = 3, a_{4} = 4$ , and $c = 5$ , we shall demonstrate an example of the complex pulsating $(a_{1}, a_{2}, \dots, a_{m}, c)$ -Fibonacci sequence. Table 1 and Fig. 2 provide more information.

Theorem 3.2

The closed form of the complex pulsating $(a_{1}, a_{2}, \dots, a_{m}, c)$ -Fibonacci sequence is $\begin{matrix} Im (P_{1, 2 k + 2}) = \dots = Im (P_{m, 2 k + 2}) = {(m + 1)}^{k} \sum_{i = 1}^{m} a_{i} + m {(m + 1)}^{k} c, \\ Im (P_{j, 2 k + 1}) = \{\begin{matrix} \frac{{(m + 1)}^{k} - 1}{m} \sum_{i = 1}^{m} a_{i} + a_{j} + {(m + 1)}^{k} c; k is odd \\ \frac{{(m + 1)}^{k} - 1}{m} \sum_{i = 1}^{m} a_{i} + a_{m - j + 1} + {(m + 1)}^{k} c; k is even \end{matrix} \end{matrix}$ for all $k \in N \cup {0}$ .

Proof

Define a linear transformation $T : R^{4 m} \to R^{4 m}$ by

(3.1)

\begin{matrix} \begin{matrix} T (δ_{1}, \dots, δ_{m}, κ_{1}, \dots, κ_{m}, ζ_{1}, \dots, ζ_{m}, μ_{1}, \dots, μ_{m}) \\ = (κ_{1} + δ_{m}, κ_{2} + δ_{m - 1}, \dots, κ_{m} + δ_{1}, \underset{m}{\underset{⏟}{p, \dots, p}}, \underset{m}{\underset{⏟}{q, \dots, q}}, \end{matrix} \\ μ_{m} + q, μ_{m - 1} + q, \dots, μ_{1} + q), \end{matrix}

where

p = \sum_{k = 1}^{m} δ_{k} + κ_{k}

and

q = \sum_{k = 1}^{m} μ_{k}

. Clearly, the matrix representation of T with respect to the standard basis is

Q = [\begin{matrix} A & 0 \\ 0 & B \end{matrix}], w h e r e A = [\begin{matrix} K_{m} & I_{m} \\ J_{m} & J_{m} \end{matrix}] a n d B = [\begin{matrix} 0 & J_{m} \\ 0 & U \end{matrix}] .

Note that U is the matrix in Lemma 2.1. Then, the matrix A can be rewritten in the following form: $A = [\begin{matrix} I_{m} & 0_{m} \\ - K_{m} & I_{m} \end{matrix}] [\begin{matrix} 0_{m} & I_{m} \\ 0_{m} & U \end{matrix}] [\begin{matrix} I_{m} & 0_{m} \\ K_{m} & I_{m} \end{matrix}] .$ We are now ready to find the closed form. For each $k \in N \cup {0}$ , we let $X_{k} = [\begin{matrix} X_{k}^{'} \\ X_{k}^{″} \end{matrix}]$ , where $X_{k}^{'} = {[\begin{matrix} Re (P_{1, k}) & \dots & Re (P_{m, k}) \end{matrix}]}^{t}$ and $X_{k}^{″} = {[\begin{matrix} Im (P_{1, k}) & \dots & Im (P_{m, k}) \end{matrix}]}^{t}$ . Moreover, we observe that

$Q [\begin{matrix} X_{2 k} \\ X_{2 k + 1} \end{matrix}] = [\begin{matrix} X_{2 k + 2} \\ X_{2 k + 3} \end{matrix}]$ . By computing directly, we have $[\begin{matrix} X_{2 k} \\ X_{2 k + 1} \end{matrix}] = Q^{k} [\begin{matrix} X_{0} \\ X_{1} \end{matrix}],$ where $X_{0} = {[\begin{matrix} a_{1} & \dots & a_{m} & c & \dots & c \end{matrix}]}_{1 \times 2 m}^{t}, X_{1} = {[\begin{matrix} c & \dots & c & c + a_{m} & c + a_{m - 1} & \dots & c + a_{1} \end{matrix}]}_{1 \times 2 m}^{t}$ and $k \in N$ . Furthermore, by block matrix multiplication, we obtain $Q^{k} = [\begin{matrix} A^{k} & 0 \\ 0 & B^{k} \end{matrix}],$ where $A^{k} = [\begin{matrix} I_{m} & 0_{m} \\ - K_{m} & I_{m} \end{matrix}] [\begin{matrix} 0_{m} & U^{k - 1} \\ 0_{m} & U^{k} \end{matrix}] [\begin{matrix} I_{m} & 0_{m} \\ K_{m} & I_{m} \end{matrix}] = [\begin{matrix} U^{k - 1} K_{m} & U^{k - 1} \\ (- K_{m} U^{k - 1} + U^{k}) K_{m} & - K_{m} U^{k - 1} + U^{k} \end{matrix}]$ and $B^{k} = [\begin{matrix} 0 & J_{m} U^{k - 1} \\ 0 & U^{k} \end{matrix}] .$

As a result, $\begin{matrix} [\begin{matrix} X_{2 k} \\ X_{2 k + 1} \end{matrix}] = Q^{k} [\begin{matrix} X_{0} \\ X_{1} \end{matrix}] \\ = [\begin{matrix} U^{k - 1} K_{m} & U^{k - 1} & 0_{m} & 0_{m} \\ (- K_{m} U^{k - 1} + U^{k}) K_{m} & - K_{m} U^{k - 1} + U^{k} & 0_{m} & 0_{m} \\ 0_{m} & 0_{m} & 0_{m} & J_{m} U^{k - 1} \\ 0_{m} & 0_{m} & 0_{m} & U^{k} \end{matrix}] [\begin{matrix} X_{0}^{'} \\ X_{0}^{''} \\ X_{1}^{'} \\ X_{1}^{''} \end{matrix}] \\ = [\begin{matrix} U^{k - 1} K_{m} X_{0}^{'} + U^{k - 1} X_{0}^{''} \\ (- K_{m} U^{k - 1} + U^{k}) K_{m} X_{0}^{'} + (- K_{m} U^{k - 1} + U^{k}) X_{0}^{''} \\ J_{m} U^{k - 1} X_{1}^{''} \\ U^{k} X_{1}^{''} \end{matrix}] . \end{matrix}$

We know that $J_{m}^{2} = {mJ}_{m}$ . Next, we let $x = \frac{{(m + 1)}^{k} - 1}{m}$ and $x^{'} = \frac{{(m + 1)}^{k - 1} - 1}{m}$ , and consider the terms of matrix multiplication in two cases:

Case 1 If k is odd, we obtain that $U^{k} = {xJ}_{m} + K_{m}$ and $U^{k - 1} = x^{'} J_{m} + I_{m}$ . Thus,

1) $\begin{matrix} U^{k - 1} K_{m} X_{0}^{'} + U^{k - 1} X_{0}^{''} = (x^{'} J_{m} + K_{m}) X_{0}^{'} + (x^{'} J_{m} + I_{m}) X_{0}^{''} \\ = [\begin{matrix} x^{'} \sum_{i = 1}^{m} a_{i} + a_{m} \\ ⋮ \\ x^{'} \sum_{i = 1}^{m} a_{i} + a_{1} \end{matrix}] + [\begin{matrix} {mx}^{'} c + c \\ ⋮ \\ {mx}^{'} c + c \end{matrix}] = {[\begin{matrix} x^{'} \sum_{i = 1}^{m} a_{i} + a_{m} + {(m + 1)}^{k - 1} c \\ ⋮ \\ x^{'} \sum_{i = 1}^{m} a_{i} + a_{1} + {(m + 1)}^{k - 1} c \end{matrix}]}_{m \times 1}, \end{matrix}$
2) $\begin{matrix} (- K_{m} U^{k - 1} + U^{k}) K_{m} X_{0}^{'} + (- K_{m} U^{k - 1} + U^{k}) X_{0}^{''} \\ = (- K_{m} (x^{'} J_{m} + I_{m}) K_{m} + ({xJ}_{m} + K_{m}) K_{m}) X_{0}^{'} + (- K_{m} (x^{'} J_{m} + I_{m}) + ({xJ}_{m} + K_{m})) X_{0}^{''} \\ = (- x^{'} J_{m} - I_{m} + {xJ}_{m} + I_{m}) X_{0}^{'} + (- x^{'} J_{m} - K_{m} + {xJ}_{m} + K_{m}) X_{0}^{''} \\ = (- x^{'} + x) J_{m} X_{0}^{'} + (- x^{'} + x) J_{m} X_{0}^{''} = {(m + 1)}^{k - 1} J_{m} (X_{0}^{'} + X_{0}^{''}) \\ = {[\begin{matrix} {(m + 1)}^{k - 1} \sum_{i = 1}^{m} a_{i} + m {(m + 1)}^{k - 1} c \end{matrix}]}_{m \times 1}, \end{matrix}$
3) $\begin{matrix} J_{m} U^{k - 1} X_{1}^{''} = J_{m} (x^{'} J_{m} + I_{m}) X_{1}^{''} = ({mx}^{'} J_{m} + J_{m}) X_{1}^{''} \\ = ({mx}^{'} + 1) J_{m} X_{1}^{''} = {(m + 1)}^{k - 1} J_{m} X_{1}^{''} = {[\begin{matrix} {(m + 1)}^{k - 1} \sum_{i = 1}^{m} a_{i} + m {(m + 1)}^{k - 1} c \end{matrix}]}_{m \times 1}, \end{matrix}$
4) $U^{k} X_{1}^{″} = ({xJ}_{m} + K_{m}) X_{1}^{″} = {[\begin{matrix} x \sum_{i = 1}^{m} a_{i} + a_{1} + {(m + 1)}^{k} c \\ ⋮ \\ x \sum_{i = 1}^{m} a_{i} + a_{m} + {(m + 1)}^{k} c \end{matrix}]}_{m \times 1} .$

We conclude that

[\begin{matrix} X_{2 k} \\ X_{2 k + 1} \end{matrix}] = Q^{k} [\begin{matrix} X_{0} \\ X_{1} \end{matrix}] = {[p_{j}]}_{4 m \times 1}

, where

p_{j}

is in the pattern as follows:

p_{j} = \{\begin{matrix} \frac{{(m + 1)}^{k - 1} - 1}{m} \sum_{i = 1}^{m} a_{i} + a_{m - j + 1} + {(m + 1)}^{k - 1} c; 1 ⩽ j ⩽ m \\ {(m + 1)}^{k - 1} \sum_{i = 1}^{m} a_{i} + m {(m + 1)}^{k - 1} c; m + 1 ⩽ j ⩽ 3 m \\ \frac{{(m + 1)}^{k} - 1}{m} \sum_{i = 1}^{m} a_{i} + a_{j - 3 m} + {(m + 1)}^{k} c; 3 m + 1 ⩽ j ⩽ 4 m . \end{matrix}

Case 2 If k is even, we obtain that $U^{k} = {xJ}_{m} + I_{m}$ and $U^{k - 1} = x^{'} J_{m} + K_{m}$ . In the same manner, we have both $(- K_{m} U^{k - 1} + U^{k}) K_{m} X_{0}^{'} + (- K_{m} U^{k - 1} + U^{k}) X_{0}^{″}$ and $J_{m} U^{k - 1} X_{1}^{″}$ are equal to

${[\begin{matrix} {(m + 1)}^{k - 1} \sum_{i = 1}^{m} a_{i} + m {(m + 1)}^{k - 1} c \end{matrix}]}_{m \times 1}$ . However, $U^{k - 1} K_{m} X_{0}^{'} + U^{k - 1} X_{0}^{''} = {[\begin{matrix} x^{'} \sum_{i = 1}^{m} a_{i} + a_{1} + {(m + 1)}^{k - 1} c \\ ⋮ \\ x^{'} \sum_{i = 1}^{m} a_{i} + a_{m} + {(m + 1)}^{k - 1} c \end{matrix}]}_{m \times 1}$ and $U^{k} X_{1}^{″} = {[\begin{matrix} x \sum_{i = 1}^{m} a_{i} + a_{m} + {(m + 1)}^{k} c \\ ⋮ \\ \sum_{i = 1}^{m} a_{i} + a_{1} + {(m + 1)}^{k} c \end{matrix}]}_{m \times 1} .$

As a result, $p_{j} = \{\begin{matrix} \frac{{(m + 1)}^{k - 1} - 1}{m} \sum_{i = 1}^{m} a_{i} + a_{j} + {(m + 1)}^{k - 1} c; 1 ⩽ j ⩽ m \\ {(m + 1)}^{k - 1} \sum_{i = 1}^{m} a_{i} + m {(m + 1)}^{k - 1} c; m + 1 ⩽ j ⩽ 3 m \\ \frac{{(m + 1)}^{k} - 1}{m} \sum_{i = 1}^{m} a_{i} + a_{4 m - j + 1} + {(m + 1)}^{k} c; 3 m + 1 ⩽ j ⩽ 4 m . \end{matrix}$

Table 1 The complex pulsating

(a_{1}, a_{2}, \dots, a_{m}, c)

-Fibonacci sequence in case

m = 4, a_{1} = 1, a_{2} = 2, a_{3} = 3, a_{4} = 4

and

c = 5

k	$P_{1, k}$		$P_{2, k}$		$P_{3, k}$		$P_{4, k}$
	$Re (P_{1, k})$	$Im (P_{1, k})$	$Re (P_{2, k})$	$Im (P_{2, k})$	$Re (P_{3, k})$	$Im (P_{3, k})$	$Re (P_{4, k})$	$Im (P_{4, k})$
1	1	5	2	5	3	5	4	5
2	5	9	5	8	5	7	5	6
3	9	30	8	30	7	30	6	30
4	30	36	30	37	30	38	30	39
5	36	150	37	150	38	150	39	150
⋮	⋮	⋮	⋮	⋮	⋮	⋮	⋮	⋮

The complex pulsating ( 1 , 2 , 3 , 4 , 5 ) -Fibonacci sequence.

3.2

3.2 The golden ratio of the complex pulsating $(a_{1}, a_{2}, \dots, a_{m}, c)$ -Fibonacci sequence

In mathematics, the Fibonacci sequence and the golden ratio are closely related. This ratio is the limit of the ratios of successive terms of the Fibonacci sequence. In the previous section, we discover the closed form of the complex pulsating $(a_{1}, a_{2}, \dots, a_{m}, c)$ -Fibonacci sequence, which is a generalization of the Fibonacci sequence. As a consequence, it is no surprise that we will look at the golden ratio of this sequence in this section. The consequence of our closed form in Section 3.1 is the ratios $\lim_{k \to \infty} \frac{Re (P_{j, 2 k + 2}) + i Im (P_{j, 2 k + 2})}{Re (P_{j, 2 k + 1}) + i Im (P_{j, 2 k + 1})}$ and $\lim_{k \to \infty} \frac{Re (P_{j, 2 k + 1}) + i Im (P_{j, 2 k + 1})}{Re (P_{j, 2 k}) + i Im (P_{j, 2 k})}$ which seem to be the well-known golden ratio. For further results, look at the following proposition.

Proposition 3.3

For each $j = 1, 2, \dots, m$ , let $(P_{j, n})$ be a complex pulsating $(a_{1}, a_{2}, \dots, a_{m}, c)$ -Fibonacci sequence as the sequence (1.8). Then, the golden ratios of this sequence are

$\lim_{k \to \infty} \frac{Re (P_{j, 2 k + 2}) + i Im (P_{j, 2 k + 2})}{Re (P_{j, 2 k + 1}) + i Im (P_{j, 2 k + 1})} = \frac{(m + 1) (m^{2} + 2 m)}{m^{2} + {(m + 1)}^{2}} + i \frac{(m + 1) (m^{2} - m - 1)}{m^{2} + {(m + 1)}^{2}}$ ,
$\lim_{k \to \infty} \frac{Re (P_{j, 2 k + 1}) + i Im (P_{j, 2 k + 1})}{Re (P_{j, 2 k}) + i Im (P_{j, 2 k})} = \frac{m^{2} + 2 m}{m^{2} + 1} - i \frac{m^{2} - m - 1}{m^{2} + 1}$ .

Proof

First, for each $j = 1, 2, \dots, m$ , we consider the ratio by using Theorem 3.2 $\begin{matrix} \lim_{k \to \infty} \frac{Im (P_{j, 2 k + 2})}{Im (P_{j, 2 k + 1})} \\ ⩽ \max \{\lim_{k \to \infty} \frac{{(m + 1)}^{k} \sum_{i = 1}^{m} a_{i} + m {(m + 1)}^{k} c}{\frac{{(m + 1)}^{k} - 1}{m} \sum_{i = 1}^{m} a_{i} + a_{j} + {(m + 1)}^{k} c}, \lim_{k \to \infty} \frac{{(m + 1)}^{k} \sum_{i = 1}^{m} a_{i} + m {(m + 1)}^{k} c}{\frac{{(m + 1)}^{k} - 1}{m} \sum_{i = 1}^{m} a_{i} + a_{m - j + 1} + {(m + 1)}^{k} c}\} \\ = \frac{\sum_{i = 1}^{m} a_{i} + mc}{\frac{1}{m} \sum_{i = 1}^{m} a_{i} + c} = m, \end{matrix}$ and in the same manner, we have $\begin{matrix} \lim_{k \to \infty} \frac{Im (P_{j, 2 k + 2})}{Im (P_{j, 2 k + 1})} \\ ⩾ \min \{\lim_{k \to \infty} \frac{{(m + 1)}^{k} \sum_{i = 1}^{m} a_{i} + m {(m + 1)}^{k} c}{\frac{{(m + 1)}^{k} - 1}{m} \sum_{i = 1}^{m} a_{i} + a_{j} + {(m + 1)}^{k} c}, \lim_{k \to \infty} \frac{{(m + 1)}^{k} \sum_{i = 1}^{m} a_{i} + m {(m + 1)}^{k} c}{\frac{{(m + 1)}^{k} - 1}{m} \sum_{i = 1}^{m} a_{i} + a_{m - j + 1} + {(m + 1)}^{k} c}\} \\ = m . \end{matrix}$

As a result, $\lim_{k \to \infty} \frac{Im (P_{j, 2 k + 2})}{Im (P_{j, 2 k + 1})} = m$ . In addition, by the same argument, we obtain $\lim_{k \to \infty} \frac{Im (P_{j, 2 k})}{Im (P_{j, 2 k + 1})} = \frac{m}{m + 1}$ for all $j = 1, 2, \dots, m$ . So, we have $\begin{matrix} \lim_{k \to \infty} \frac{Re (P_{j, 2 k + 2}) + i Im (P_{j, 2 k + 2})}{Re (P_{j, 2 k + 1}) + i Im (P_{j, 2 k + 1})} = \lim_{k \to \infty} \frac{Im (P_{j, 2 k + 1}) + i Im (P_{j, 2 k + 2})}{Im (P_{j, 2 k}) + i Im (P_{j, 2 k + 1})} \\ = \lim_{k \to \infty} \frac{1 + i (\frac{Im (P_{j, 2 k + 2})}{Im (P_{j, 2 k + 1})})}{\frac{Im (P_{j, 2 k})}{Im (P_{j, 2 k + 1})} + i} \\ = \frac{1 + im}{\frac{m}{m + 1} + i} = \frac{(m + 1) (m^{2} + 2 m)}{m^{2} + {(m + 1)}^{2}} + i \frac{(m + 1) (m^{2} - m - 1)}{m^{2} + {(m + 1)}^{2}} . \end{matrix}$

And, $\begin{matrix} \lim_{k \to \infty} \frac{Re (P_{j, 2 k + 1}) + i Im (P_{j, 2 k + 1})}{Re (P_{j, 2 k}) + i Im (P_{j, 2 k})} = \lim_{k \to \infty} \frac{Im (P_{j, 2 k}) + i Im (P_{j, 2 k + 1})}{Im (P_{j, 2 k - 1}) + i Im (P_{j, 2 k})} \\ = \lim_{k \to \infty} \frac{1 + i (\frac{Im (P_{j, 2 k + 1})}{Im (P_{j, 2 k})})}{\frac{Im (P_{j, 2 k - 1})}{Im (P_{j, 2 k})} + i} \\ = \frac{1 + i (\frac{m + 1}{m})}{\frac{1}{m} + i} = \frac{m^{2} + 2 m}{m^{2} + 1} - i \frac{m^{2} - m - 1}{m^{2} + 1} . \end{matrix}$

4 Conclusion and Discussion

Actually, the heart of this paper is to find the appropriate matrix Q to use in the proof of Theorem 3.2 but the matrix Q can take many different forms. The variety of Q depends on a linear map T which obeys the rule in (1.8). Here is one of the examples of Q that we ever used to solve (1.8). Let $X_{n} = {[\begin{matrix} Re (P_{1, n}) & Im (P_{1, n}) & \dots & Re (P_{m, n}) & Im (P_{m, n}) \end{matrix}]}^{t}$ for $n \in N \cup {0}$ and $T : R^{4 m} \to R^{4 m}$ be defined by $T (x_{1}, x_{2}, \dots, x_{4 m}) = (x_{2} + x_{2 m - 1}, y, x_{4} + x_{2 m - 3}, y, \dots, x_{2 m} + x_{1}, y, y, x_{4 m} + y, y, x_{4 m - 2} + y, \dots, y, x_{2 m + 2} + y)$ where $y = \sum_{k = 1}^{m} x_{2 (m + k)}$ . Then the matrix Q is in the form $[\begin{matrix} A & C \\ 0 & B \end{matrix}]$ where $A_{2 m \times 2 m} = [a_{ij}] = \{\begin{matrix} 1; (j is odd and i = 2 m - j) or (j is even and i = j - 1), \\ 0; otherwise, \end{matrix}$ $B_{2 m \times 2 m} = [b_{ij}] = \{\begin{matrix} 0; j is odd, \\ 2; j ⩽ m, j is even and i = 2 m + j - 2, \\ 0; otherwise, \end{matrix}$ $and C_{2 m \times 2 m} = [c_{ij}] = \{\begin{matrix} 0; j is odd, \\ 2; j ⩾ m + 1, j is even and i = 2 m - j + 2, \\ 0; otherwise . \end{matrix}$ In the same manner, we know that $[\begin{matrix} X_{2 n} \\ X_{2 n + 1} \end{matrix}] = Q^{n} [\begin{matrix} X_{0} \\ X_{1} \end{matrix}]$ , where $X_{0} = {[\begin{matrix} a_{1} & c & a_{2} & c & \dots & a_{m} & c \end{matrix}]}_{1 \times 2 m}^{t}$ , $X_{1} = {[\begin{matrix} c & c + a_{m} & c & c + a_{m - 1} & \dots & c & c + a_{1} \end{matrix}]}_{1 \times 2 m}^{t}$ . The matrix $Q^{n}$ looks uneasily to compute its closed form. So, here is the reason that we choose the map T in (3.1) because its matrix representation is in the form $Q = [\begin{matrix} A & 0 \\ 0 & B \end{matrix}]$ which is easily compute $Q^{n}$ . Even though, the matrix $A = [\begin{matrix} K_{m} & I_{m} \\ J_{m} & J_{m} \end{matrix}]$ looks so complicated but it can be decomposed as follows: $A = [\begin{matrix} I_{m} & 0_{m} \\ - K_{m} & I_{m} \end{matrix}] [\begin{matrix} 0_{m} & I_{m} \\ 0_{m} & U \end{matrix}] [\begin{matrix} I_{m} & 0_{m} \\ K_{m} & I_{m} \end{matrix}]$ . Moreover, the matrix $[\begin{matrix} I_{m} & 0_{m} \\ - K_{m} & I_{m} \end{matrix}]$ is the inverse of $[\begin{matrix} I_{m} & 0_{m} \\ K_{m} & I_{m} \end{matrix}]$ , which makes it easier to see $A^{n}$ . Then, the computation of $Q^{n}$ is simplified to only find the matrix $U^{n}$ . So, we have to collect all of the eigenvalues and eigenvectors in Lemma 2.1 and complete our work in Lemma2.2 for finding the closed form of $U^{n}$ . Until now, we can see that the construction of Q relies on the rearrangement in the entries of the matrix $X_{n}$ and the formula of a map T. Both of these may lead us to vary directions for getting Q.

By the way, we believe that our tactics to create the matrix Q in Section 3.1 are not the best. So, we wish to see a friendly matrix Q that can be computed favorably.

Acknowledgment

We would like to thank the reviewers for their valuable suggestions. This research was financially supported by Walailak University Grant No. WU63247 and the new strategic research project (P2P) fiscal year 2022, Walailak University, Thailand.

Declaration of Competing Interest

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

References

Atanassov K., . Pulsating Fibonacci sequence. Notes Number Theory Discrete Math.. 2013;19:12-14.
[Google Scholar]
Atanassov K., . n-Pulsated Fibonacci sequence. Notes Number Theory Discrete Math.. 2014;20:32-35.
[Google Scholar]
Atanassov K., Atanassova L., Sasselov D., . A new perspective to the generalization of the Fibonacci sequence. Fibonacci Quart.. 1985;23:21-28.
[Google Scholar]
Atanassov K., Atanassova V., Shannon A., Turner J., . New visual perspectives on Fibonacci numbers. Singapore: World Scientific Publishing; 2001. pp. 3–38
Gupta V., Panwar Y., Sikhwal O., . Generalized Fibonacci sequences. TMA. 2012;2:115-124.
[Google Scholar]
Halici S., Karatas A., . On complex pulsating Fibonacci sequence. Konuralp J. Math.. 2019;7:274-278.
[Google Scholar]
Horadam A., . A generalized Fibonacci sequence. Amer. Math. Monthly. 1961;68:455-459.
[Google Scholar]
Javaheri M., Krylov N., . Complete generalized Fibonacci sequences modulo primes. Mosc. J. Comb. Number Theory. 2020;9:1-15.
[Google Scholar]
Kalman D., Mena R., . The Fibonacci numbers - exposed. Math. Mag.. 2003;76:167-181.
[Google Scholar]
Miles E., . Generalized Fibonacci numbers and associated matrices. Amer. Math. Monthly. 1960;67:745-752.
[Google Scholar]
Wani A.A., Rathore G.P.S., Sisodiya K., . On generalized k-Fibonacci sequence by two-cross-two matrix. GJMA. 2017;5:1-5.
[Google Scholar]

Introduction and Literature Review

Preliminaries

Main results

The closed form of the complex pulsating ( a 1 , a 2 , … , a m , c ) -Fibonacci sequence
The golden ratio of the complex pulsating ( a 1 , a 2 , … , a m , c ) -Fibonacci sequence

Conclusion and Discussion

Fulltext Views
7

PDF downloads
6

View/Download PDF
Download Citations

BibTeX
RIS

Show Sections

[1] Atanassov K., . Pulsating Fibonacci sequence. Notes Number Theory Discrete Math.. 2013;19:12-14.
[Google Scholar]

[2] Atanassov K., . n-Pulsated Fibonacci sequence. Notes Number Theory Discrete Math.. 2014;20:32-35.
[Google Scholar]

[3] Atanassov K., Atanassova L., Sasselov D., . A new perspective to the generalization of the Fibonacci sequence. Fibonacci Quart.. 1985;23:21-28.
[Google Scholar]

[4] Atanassov K., Atanassova V., Shannon A., Turner J., . New visual perspectives on Fibonacci numbers. Singapore: World Scientific Publishing; 2001. pp. 3–38

[5] Gupta V., Panwar Y., Sikhwal O., . Generalized Fibonacci sequences. TMA. 2012;2:115-124.
[Google Scholar]

[6] Halici S., Karatas A., . On complex pulsating Fibonacci sequence. Konuralp J. Math.. 2019;7:274-278.
[Google Scholar]

[7] Horadam A., . A generalized Fibonacci sequence. Amer. Math. Monthly. 1961;68:455-459.
[Google Scholar]

[8] Javaheri M., Krylov N., . Complete generalized Fibonacci sequences modulo primes. Mosc. J. Comb. Number Theory. 2020;9:1-15.
[Google Scholar]

[9] Kalman D., Mena R., . The Fibonacci numbers - exposed. Math. Mag.. 2003;76:167-181.
[Google Scholar]

[10] Miles E., . Generalized Fibonacci numbers and associated matrices. Amer. Math. Monthly. 1960;67:745-752.
[Google Scholar]

[11] Wani A.A., Rathore G.P.S., Sisodiya K., . On generalized k-Fibonacci sequence by two-cross-two matrix. GJMA. 2017;5:1-5.
[Google Scholar]

The complex pulsating ( a 1 , a 2 , … , a m , c ) -Fibonacci sequence

Abstract

Keywords

Pulsating Fibonacci sequence

Golden ratio

Eigenvalue

Eigenvector

Block matrix

The floor function

11B39

11B83

15A21

15A23

1 Introduction and Literature Review

2 Preliminaries

3 Main results

3.1 The closed form of the complex pulsating ( a 1 , a 2 , … , a m , c ) -Fibonacci sequence

3.2 The golden ratio of the complex pulsating ( a 1 , a 2 , … , a m , c ) -Fibonacci sequence

4 Conclusion and Discussion

Acknowledgment

Declaration of Competing Interest

References

Suggested read for related articles:

The complex pulsating $(a_{1}, a_{2}, \dots, a_{m}, c)$ -Fibonacci sequence

3.1 The closed form of the complex pulsating $(a_{1}, a_{2}, \dots, a_{m}, c)$ -Fibonacci sequence

3.2 The golden ratio of the complex pulsating $(a_{1}, a_{2}, \dots, a_{m}, c)$ -Fibonacci sequence