Related papers: Some Fibonacci-Related Sequences
It's the age-old recurrence with a twist: sum the last two terms and if the result is composite, divide by its smallest prime divisor to get the next term (e.g., 0, 1, 1, 2, 3, 5, 4, 3, 7, ...). These sequences exhibit pseudo-random…
We derive an identity connecting any two second-order linear recurrence sequences having the same recurrence relation but whose initial terms may be different. Binomial and ordinary summation identities arising from the identity are…
We survey and prove properties a family of recurrences bears in relation to integer representations, compositions, the Pascal triangle, sums of digits, Nim games and Beatty sequences.
We consider $m$-th order linear recurrences that can be thought of as generalizations of the Lucas sequence. We exploit some interplay with matrices that again can be considered generalizations of the Fibonacci matrix. We introduce the…
We dedicate this paper to investigate the most generalized form of Fibonacci Sequence, one of the most studied sections of the mathematical literature. One can notice that, we have discussed even a more general form of the conventional one.…
We consider the structure of a variation of the Fibonacci sequence which is determined by a Bernoulli process. The associated structure of all Bernoulli variations of the Fibonacci sequence can be represented by a directed binary tree,…
We establish some identities relating two sequences that are, as explained, related to the Tribonacci sequence. One of these sequences bears the same resemblance to the Tribonacci sequence as the Lucas sequence does to the Fibonacci…
We introduce a subclass of linear recurrence sequences which we call poly-rational sequences because they are denoted by rational expressions closed under sum and product. We show that this class is robust by giving several…
By investigating a recurrence relation about functions, we first give alternative proofs of various identities on Fibonacci numbers and Lucas numbers, and then, make certain well known identities visible via certain trivalent graph…
We construct automata with input(s) in Fibonacci representation (also known as Zeckendorf representation) recognizing some basic arithmetic relations and study their number of states. We also consider some basic operations on…
In this short note, we establish some identities containing sums of binomials with coefficients satisfying third order linear recursive relations. As a result and in particular, we obtain general forms of earlier identities involving…
Venkatachala on the one hand, and Avdispahi\'c & Zejnulahi on the other, both studiied integer sequences with an unusual sum property defined in a greedy way, and proved many results about them. However, their proofs were rather lengthy and…
The Fibonacci sequence has been generalized in many ways. One of them is defined by the relation $t_n=at_{n-1}+t_{n-2}$ if $n$ is even, $t_n=bt_{n-1}+t_{n-2}$ if $n$ is odd, with initial values $t_0=0$ and $t_1=1$, where $a$ and $b$ are…
We study Fibonacci compositions, which are compositions of natural numbers that only use Fibonacci numbers, in two different contexts. We first prove inequalities comparing the number of Fibonacci compositions to regular compositions where…
Morphic sequences form a natural class of infinite sequences, typically defined as the coding of a fixed point of a morphism. Different morphisms and codings may yield the same morphic sequence. This paper investigates how to prove that two…
The study describes a class of integer labelings of the Fibonacci tree, the tree of descent introduced by Fibonacci. In these labelings, Fibonacci sequences appear along ascending branches of the tree, and it is shown that the labels at any…
In this paper 101 new integer sequences, sub-sequences, and sequences of sequences, together with related unsolved problems and conjectures, are presented. Also, definitions, examples, solved or open questions, and references for each…
In this study, we apply the binomial transforms to Tribonacci and Tribonacci-Lucas sequences. Also, the Binet formulas, summations, generating functions of these transforms are found using recurrence relations. Finally, we illustrate the…
Solutions to the random Fibonacci recurrence x_{n+1}=x_{n} + or - Bx_{n-1} decrease (increase) exponentially, x_{n} = exp(lambda n), for sufficiently small (large) B. In the limits B --> 0 and B --> infinity, we expand the Lyapunov exponent…
Let $(F_n)_{n\geq 0}$ be the Fibonacci sequence given by the recurrence $F_{n+2}=F_{n+1}+F_n$, for $n\geq 0$, where $F_0=0$ and $F_1=1$. There are several generalizations of this sequence and also several interesting identities. In this…