Related papers: A simplified Binet formula for k-generalized Fibon…
In this paper, we study the linear space of all two-sided generalized Fibonacci sequences $\{F_n\}_{n \in \mathbb{Z}}$ that satisfy the recurrence equation of order $k$: $F_n = F_{n-1} + F_{n-2} + \dots + F_{n-k}$. We give two types of…
In this paper, we have constructed the higher order k-bonacci matrices and studied some of their basic properties. We have also shown that these matrices satisfying some new and interesting relations in k-bonacci recurrence. This is the…
We present a quite curious generalization of multi-step Fibonacci numbers. For any positive rational $q$, we enumerate binary words of length $n$ whose maximal factors of the form $0^a1^b$ satisfy $a = 0$ or $aq > b$. When $q$ is an integer…
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…
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…
In this paper we consider particular generalized compositions of a natural number with a given number of parts. Its number is a weighted polynomial coefficient. The number of all generalized compositions of a natural number is a weighted…
In this paper, we give a new representation of the Fibonacci numbers. This is achieved using Fibonacci trees. With the help of this representation, the nth Fibonacci number can be calculated without having any knowledge about the previous…
We use combinatorial and generating function techniques to enumerate various sets of involutions which avoid 231 or contain 231 exactly once. Interestingly, many of these enumerations can be given in terms of $k$-generalized Fibonacci…
The aim of this paper is to construct general forms of ordinary generating functions for special numbers and polynomials involving Fibonacci type numbers and polynomials, Lucas numbers and polynomials, Chebyshev polynomials, Sextet…
In this paper, using a generating function approach, we derive several new convolution sum identities involving Fibonacci m-step numbers. As special instances of the results derived herein, we will get many new and known results involving…
Balancing numbers possess, as Fibonacci numbers, a Binet formula. Using this, partial sums of arbitrary powers of balancing numbers can be summed explicitly. For this, as a first step, a power $B_n^l$ is expressed as a linear combination of…
The Fibonacci sequence is obtained as weighted sum along the rows in the Pascal triangle by choosing a periodic up-and-down pattern of weights from the set $\{-1,-\frac{1}{2},0, \frac{1}{2}, 1\}$. A graphical illustration of this identity…
An overlooked formula of E. Lucas for the generalized Bernoulli numbers is proved using generating functions. This is then used to provide a new proof and a new form of a sum involving classical Bernoulli numbers studied by K. Dilcher. The…
Horadam introduced a new generalized sequence of numbers, describing its key features and the special sub-sequences that are obtained depending on the choices of initial parameters. This sequence and its sub-sequences are known as the…
In this paper, we introduce h(x)-Fibonacci polynomials in an arbitrary finite-dimensional unitary algebra over a field K (K = R,C), which generalize both h(x)-Fibonacci quaternion polynomials and h(x)-Fibonacci octonion polynomials. For…
We derive weighted sums, including binomial and double binomial sums, for the generalized Fibonacci sequence $\{G_m\}$ where for $m\ge 2$, $G_m=G_{m-1}+G_{m-2}$ with initial values $G_0$ and $G_1$.
We prove some identities for the squares of generalized Tribonacci numbers. Various summation identities involving these numbers are derived.
In this paper, we find the closed sums of certain type of Fibonacci related convergent series. In particular, we generalize some results already obtained by Brousseau, Popov, Rabinowitz and others.
Let $k\geq2$. Then the $k$-th order Fibonacci cube $\Gamma^{(k)}_{n}$ is the subgraph of the hypercube $Q_{n}$ induced by vertices without $k$ consecutive $1$s. The case $k=2$ corresponds to the classic Fibonacci cube $\Gamma_{n}$. There…
For an integer $ k\geq 2 $, let $ \{F^{(k)}_{n} \}_{n\geq 0}$ be the $ k$--generalized Fibonacci sequence which starts with $ 0, \ldots, 0, 1 $ ($ k $ terms) and each term afterwards is the sum of the $ k $ preceding terms. In this paper,…