Related papers: Fibonacci Modules and Multiple Fibonacci Sequences
The paper investigates relationship between algebraic expressions and graphs. We consider a digraph called a Fibonacci graph which gives a generic example of non-series-parallel graphs. Our intention in this paper is to simplify the…
In a previous paper we have presented a partition formula for the even-index Fibonacci numbers using the preprojective representations of the 3-Kronecker quiver and its universal cover, the 3-regular star. Now we deal in a similar way with…
In this paper, we consider infinite sums derived from the reciprocals of the generalized Fibonacci numbers. We obtain some new and interesting identities for the generalized Fibonacci numbers.
We present numerous interesting, mostly new, results involving the $n$-step Fibonacci numbers and $n$-step Lucas numbers and a generalization. Properties considered include recurrence relations, summation identities, including binomial and…
We discuss properties of integers in base 3/2. We also introduce many new sequences related to base 3/2. Some sequences discuss patterns related to integers in base 3/2. Other sequence are analogues of famous base-10 sequences: we discuss…
This paper presents an innovative approach to the study of recurrent sequences by introducing the concept of arithmetic pseudo-operators. Unlike conventional operators, these pseudo-operators are pure complex numbers with specific…
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 investigate a result on convergence of double sequences of numbers and how it extends to measurable functions.
The aim of this note is to survey the factorizations of the Fibonacci infinite word that make use of the Fibonacci words and other related words, and to show that all these factorizations can be easily derived in sequence starting from…
This study applies the binomial, k-binomial, rising k-binomial and falling k-binomial transforms to the modified k-Fibonacci-like sequence. Also, the Binet formulas and generating functions of the above mentioned four transforms are newly…
In this work, we made a generalization that includes all bicomplex Fibonacci-like numbers such as; Fibonacci, Lucas, Pell, etc.. We named this generalization as bicomplex Horadam numbers. For bicomplex Fibonacci and Lucas numbers we gave…
Recent results about sums of cubes of Fibonacci numbers [Frontczak, 2018] are extended to arbitrary powers.
We prove that certain sequences of finite continued fractions associated with a 2-periodic continued fraction with period a,b>0 are moment sequences of discrete signed measures supported in the interval [-1,1], and we give necessary and…
The regularized product of the Fibonacci numbers is evaluated.
Given any two sequences of complex numbers, we establish simple relations between their binomial convolution and the binomial convolution of their individual binomial transforms. We employ these relations to derive new identities involving…
In this paper, we connect two well established theories, the Fibonacci numbers and the Jordan algebras. We give a series of matrices, from literature, used to obtain recurrence relations of second-order and polynomial sequences. We also…
Integer compositions, integer partitions, Fibonacci numbers, and generalizations of these have recently been shown to be interconnected via two-toned tilings of horizontal grids. In this article, we present refinements of two-toned tilings,…
The Fibonacci numbers are a sequence of integers in which every number after the first two, 0 and 1, is the sum of the two preceding numbers. These numbers are well known and algorithms to compute them are so easy that they are often used…
Among the classical models for interconnection networks are hypercubes and Fibonacci cubes. Fibonacci cubes are induced subgraphs of hypercubes obtained by restricting the vertex set to those binary strings which do not contain consecutive…
The focus of this note is to formulate the algorithms and give the examples used by Fibonacci in Liber Abaci to expand any fraction into a sum of unit fractions. The description in Liber Abaci is all verbal and the examples are numbers…