Related papers: An Elementary Proof of the Generalization of the B…
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…
This paper proves why the Stirling numbers show up in a experimentally determined formula for the $k$-bonaccis. We develop a bijection between a previously determined summation formula for $k$-bonaccis and an experimentally determined…
We introduce the $k$-bonacci polyominoes, a new family of polyominoes associated with the binary words avoiding $k$ consecutive $1$'s, also called generalized $k$-bonacci words. The polyominoes are very entrancing objects, considered in…
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…
We investigate general properties of number sequences which allow explicit representation in terms of products. We find that such sequences form whole families of number sequences sharing similar recursive identities. Restricting to the…
As a generalization of polyominoes we consider edge-to-edge connected nonoverlapping unions of regular $k$-gons. For $n\le 4$ we determine formulas for the number $a_k(n)$ of generalized polyominoes consisting of $n$ regular $k$-gons.…
The focus of this paper is the study of generalized Fibonacci polynomials and Fibonomial coefficients. The former are polynomials {n} in variables s and t given by {0} = 0, {1} = 1, and {n} = s{n-1}+t{n-2} for n ge 2. The latter are defined…
In this paper, we define k-generalized order-k numbers and we obtain a relation between i-th sequences and k-th sequences of k-generalized order-k numbers. We give some determinantal and permanental representations of k-generalized order-k…
In this paper, we study a generalization of Jacobsthal and Jacobsthal-Lucas numbers, we find their generating function binet formulas, related matrix representation and many other properties
We evaluate a determinant of generalized Fibonacci numbers, thus providing a common generalization of several determinant evaluation results that have previously appeared in the literature, all of them extending Cassini's identity for…
The Fibonacci polynomials are defined recursively as $f_{n}(x)=xf_{n-1}(x)+f_{n-2}(x)$, where $f_0(x) = 0$ and $f_1(x)= 1$. We generalize these polynomials to an arbitrary number of variables with the $r$-Fibonacci polynomial. We extend…
Our goal in this work is to found a closed form for rational generat- ing functions, these generate a various families of polynomials and generalized polynomials, in order to get the general recursive formula satisfied by these polynomials.
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…
Let $F_n(k)$ be the generalized Fibonacci number defined by (with $F_i(k)$ abbreviated to $F_i$): $F_n = F_{n-1} + F_{n-2} + \dots + F_{n-k}$, for $n \geq k$, and the initial values $(F_0,F_1,...,F_{k-1})$. Let $B_n(k,j)$ be $F_n(k)$ with…
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…
In this paper, we define new generalized k-Mersenne numbers and give a formula of generalized Mersenne polynomials and further we study their properties. Moreover, we define Gaussian Mersenne numbers and obtain some identities like Binet…
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 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…
We prove a duality formula for certain sums of values of poly-Bernoulli polynomials which generalizes dualities for poly-Bernoulli numbers. We first compute two types of generating functions for these sums, from which the duality formula is…
In this work, the authors provide closed forms and recurrence expressions for computing the $k$th power of the formal power series, some of them in terms of a determinant of some matrices. As a consequence, we obtain the reciprocal of the…