Abstract:It is well known that a continued fraction is periodic if and only if it is the representation of a quadratic irrational˛. In this paper, we consider the family of sequences obtained from the recurrence relation generated by the numerators of the convergents of these numbers˛. These sequences are generalizations of most of the Fibonacci-like sequences, such as the Fibonacci sequence itself, r-Fibonacci sequences, and the Pell sequence, to name a few. We show that these sequences satisfy a linear recurrence rel… Show more
“…Binet's formulae are well known in the study of sequences like Fibonacci sequence [1,2,3,4,6,7,8,10,11,12]. In this section, we introduce and prove Binet's formula for the modified k-Fibonacci-like sequence.…”
Section: Binet's Formula Of the Modified K-fibonacci-like Sequencementioning
confidence: 99%
“…Edson and Yayenie [4] introduced the generalized Fibonacci sequence and proved some related identities. For any two nonzero real numbers a and b, the generalized Fibonacci sequence {q n } ∞ n=0 is defined by the recurrence relation (3) q n = aq n−1 + q n−2 , if n is even, bq n−1 + q n−2 , if n is odd, (n ≥ 2), with q 0 = 0 and q 1 = 1.…”
Section: Introductionmentioning
confidence: 99%
“…Edson, Lewis and Yayenie [3] introduced the k-periodic Fibonacci sequence and proved some related identities. For any k-tuple (x 1 , x 2 , .…”
Abstract. The Fibonacci sequence is a sequence of numbers that has been studied for hundreds of years. In this paper, we introduce the modified k-Fibonacci-like sequence and prove Binet's formula for this sequence and then use it to introduce and prove the Catalan, Cassini, and d'Ocagne identities for the modified k-Fibonacci-like sequence. Also, the ordinary generating function of this sequence is stated.
“…Binet's formulae are well known in the study of sequences like Fibonacci sequence [1,2,3,4,6,7,8,10,11,12]. In this section, we introduce and prove Binet's formula for the modified k-Fibonacci-like sequence.…”
Section: Binet's Formula Of the Modified K-fibonacci-like Sequencementioning
confidence: 99%
“…Edson and Yayenie [4] introduced the generalized Fibonacci sequence and proved some related identities. For any two nonzero real numbers a and b, the generalized Fibonacci sequence {q n } ∞ n=0 is defined by the recurrence relation (3) q n = aq n−1 + q n−2 , if n is even, bq n−1 + q n−2 , if n is odd, (n ≥ 2), with q 0 = 0 and q 1 = 1.…”
Section: Introductionmentioning
confidence: 99%
“…Edson, Lewis and Yayenie [3] introduced the k-periodic Fibonacci sequence and proved some related identities. For any k-tuple (x 1 , x 2 , .…”
Abstract. The Fibonacci sequence is a sequence of numbers that has been studied for hundreds of years. In this paper, we introduce the modified k-Fibonacci-like sequence and prove Binet's formula for this sequence and then use it to introduce and prove the Catalan, Cassini, and d'Ocagne identities for the modified k-Fibonacci-like sequence. Also, the ordinary generating function of this sequence is stated.
“…These sequences arise in a natural way in the study of continued fractions of quadratic irrationals (see [3]) and combinatorics on words or dynamical system theory. Some well-known sequences are special cases of this generalization.…”
Abstract. In this note, we consider a generalized Fibonacci sequence {q n }. We give a generating matrix for {q n }. With the aid of this matrix, we derive and re-prove some properties involving terms of this sequence
“…We call such a sequence a general conditional recurrence sequence with associated coefficient matrix (2) If s ¼ 2 and a i;2 ¼ 1 for 0 6 i 6 r À 1 with any nonzero real numbers a i;1 , we obtain the sequences studied in [3], the k-periodic Fibonacci sequences. These sequences are also studied independently in [11,13].…”
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.