Related papers: The Binomial Transforms of Tribonacci and Tribonac…
This paper is devoted to the study of the log-convexity of combinatorial sequences. We show that the log-convexity is preserved under componentwise sum, under binomial convolution, and by the linear transformations given by the matrices of…
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…
Only one three-term recurrence relation, namely, $W_{r}=2W_{r-1}-W_{r-4}$, is known for the generalized Tribonacci numbers, $W_r$, $r\in\mathbb{Z}$, defined by $W_{r}=W_{r-1}+W_{r-2}+W_{r-3}$ and \mbox{$W_{-r}=W_{-r+3}-W_{-r+2}-W_{-r+1}$},…
In this paper, we study the binomial sum $S_{n}(q):=% \overset{n}{\underset{k=0}{\sum }}a_{k}\binom{n}{k}\left( 1-q\right) ^{k}q^{n-k}$ for a given sequence $\left( a_{n}\right) $ of real or complex numbers. We express $S_{n}(q)$ in…
The quaternions form a 4-dimensional Cayley-Dickson algebra. In this paper, we introduce the Tetranacci and Tetranacci-Lucas quaternions. Furthermore, we present some properties of these quaternions and derive relationships between them.
We present an elementary proof of the generalization of the $k$-bonacci Binet formula, a closed form calculation of the $k$-bonacci numbers using the roots of the characteristic polynomial of the $k$-bonacci recursion.
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…
In this paper, we shall find a new connection between $n$th degree polynomial mod $p$ congruence with $n$ roots and higher-order Fibonacci and Lucas sequences. We shall first discuss the recent work been done in sequences and their…
We derive closed form expressions for finite and infinite Fibonacci-Lucas sums having products of Fibonacci or Lucas numbers in the denominator of the summand. Our results generalize and extend those obtained by pioneer Brother Alfred…
We present a particularly nice Binet-style formula that can be used to produce the k-generalized Fibonacci numbers (that is, the Tribonaccis, Tetranaccis, etc). Furthermore, we show that in fact one needs only take the integer closest to…
In this article, we introduce and study a new integer sequence referred to as the higher order Mersenne sequence. The proposed sequence is analogous to the higher order Fibonacci numbers and closely associated with the Mersenne numbers.…
By using definition of Golden derivative, corresponding Golden exponential function and Fibonomial coefficients, we introduce generating functions for Bernoulli-Fibonacci polynomials and related numbers. Properties of these polynomials and…
In this paper we generalize to bivariate polynomials of Fibonacci and Lucas, properties obtained for Chebyshev polynomials. We prove that the coordinates of the bivariate polynomials over appropriate basis are families of integers…
This note gives an elementary exposition of a variant of the spread polynomials in terms of Fibonacci and Lucas polynomials.
We prove some identities for the squares of generalized Tribonacci numbers. Various summation identities involving these numbers are derived.
Powers of Fibonacci polynomials are expressed as single sums, improving on a double sum recently seen in the literature.
In this paper, we establish several formulae for sums and alternating sums of products of generalized Fibonacci and Lucas numbers. In particular, we recover and extend all results of Z. Cerin and Z. Cerin & G. M. Gianella, more easily.
At this paper, we derive some relationships between permanents of one type of lower-Hessenberg matrix and the Fibonacci and Lucas numbers and their sums.
In this paper, we explore a variety of series involving the central binomial coefficients, highlighting their structural properties and connections to other mathematical objects. Specifically, we derive new closed-form representations and…
Modifying an idea of E. Brietzke we give simple proofs for the recurrence relations of some sequences of binomial sums which have previously been obtained by other more complicated methods.