Related papers: Generalized Compositions and Weighted Fibonacci Nu…
We consider compositions of natural numbers when there are different types of each natural number. Several recursions as well as some closed formulas for the number of compositions is derived. We also find its relationships with some known…
We investigate compositions of a positive integer with a fixed number of parts, when there are several types of each natural number. These compositions produce new relationships among binomial coefficients, Catalan numbers, and numbers of…
We consider two type of upper Hessenberg matrices which determinants are Fibonacci numbers. Calculating sums of principal minors of the fixed order of the first type leads us to convolved Fibonacci numbers. Some identities for these and for…
The Fibonacci number is the residue of a rational function, from which follows that Fibonacci number summation identities can be derived with the integral representation method, a method also used to derive combinatorial identities. A…
In part 1 of this paper some linear weighted generalized Fibonacci number summation identities were derived using the fact that the Fibonacci number is the residue of a rational function. In this part, using the same method, some quadratic…
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 present a relationship between the generalized hyperharmonic numbers and the poly-Bernoulli polynomials, motivated from the connections between harmonic and Bernoulli numbers. This relationship yields numerous identities for the…
We first give a combinatorial interpretation of coefficients of Chebyshev polynomials, which allows us to connect them with compositions of natural numbers. Then we describe a relationship between the number of compositions of a natural…
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…
Let $ k \geq 2 $ be an integer. The $ k- $generalized Fibonacci sequence is a sequence defined by the recurrence relation $ F_{n}^{(k)}=F_{n-1}^{(k)} + \cdots + F_{n-k}^{(k)}$ for all $ n \geq 2$ with the initial values $ F_{i}^{(k)}=0 $…
In this paper, we present a new generalization of the Lucas numbers by matrix representation using Genaralized Lucas Polynomials. We give some properties of this new generalization and some relations between the generalized order-k Lucas…
We define generalized bivariate polynomials, from which upon specification of initial conditions the bivariate Fibonacci and Lucas polynomials are obtained. Using essentially a matrix approach we derive identities and inequalities that in…
In this article, we give a formula for the generalization of the binomial coefficient to the complex numbers as a linear combination of $\sinc$ functions. We then give a general formula to compute the integral on the real line of the…
An integer composition of a nonnegative integer $n$ is a tuple $(\pi_1,\ldots,\pi_k)$ of nonnegative integers whose sum is $n$; the $\pi_i$'s are called the parts of the composition. For fixed number $k$ of parts, the number of $f$-weighted…
Fibonacci sequence, generated by summing the preceding two terms, is a classical sequence renowned for its elegant properties. In this paper, leveraging properties of generalized Fibonacci sequences and formulas for consecutive sums of…
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…
Generalized numberings are an extension of Ershov's notion of numbering, based on partial combinatory algebra (pca) instead of the natural numbers. We study various algebraic properties of generalized numberings, relating properties of the…
The Concepts of poly-Bernoulli numbers $B_n^{(k)}$, poly-Bernoulli polynomials $B_n^{k}{(t)}$ and the generalized poly-bernoulli numbers $B_{n}^{(k)}(a,b)$ are generalized to $B_{n}^{(k)}(t,a,b,c)$ which is called the generalized…
We study formulas expressing Fibonacci numbers as sums over compositions using free submonoids of the free monoid of compositions with parts 1 and 2.
We study determinants of matrices whose entries are powers of Fibonacci numbers. We then extend the results to include entries that are powers of generalized Fibonacci numbers defined as a second-order linear recurrence relation. These…