Related papers: On the third-order Horadam matrix sequences
We study the partial Hadamard matrices $H\in M_{M\times N}(\mathbb C)$ which are regular, in the sense that the scalar products between pairs of distinct rows decompose as sums of cycles (rotated sums of roots of unity). The simplest…
The generalized Fibonacci sequences are sequences $\{f_n\}$ which satisfy the recurrence $f_n(s, t) = sf_{n - 1}(s, t) + tf_{n - 2}(s, t)$ ($s, t \in \mathbb{Z}$) with initial conditions $f_0(s, t) = 0$ and $f_1(s, t) = 1$. In a recent…
In this study, we introduce the generalized Tribonacci hyperbolic spinors and properties of this new special numbers system by the generalized Tribonacci numbers, which are one of the most general form of the third-order recurrence…
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 evaluate some new three parameter families of finite reciprocal sums involving Horadam numbers. We will also be able to state the results for the infinite sums. Some Fibonacci and Lucas sums will be presented as examples.
We recognise Harada's generalized categories of diagrams as a particular case of modules over a monad defined on a finite direct product of additive categories. We work in the dual (albeit formally equivalent) situation, that is, with…
We give an overview about some elementary properties of Hoggatt matrices, which are generalizations of Pascal triangle, and study q-analogs and Fibonacci analogs and derive a common generalization.
In this paper, firstly, we define the Generalized Tribonacci-Lucas numbers. In addition, by also defining circulant matrices C_{n}(G) and C_{n}(S) whose entries are Generalized Tribonacci and Generalized Tribonacci-Lucas numbers, we compute…
We give recurrence relations for any family of generalized Appell polynomials unifying so some known recurrences of many classical sequences of polynomials. Our main tool to get our goal is the Riordan group. We use the product of Riordan…
In this paper, closed forms of the summation formulas for generalized Tribonacci numbers are presented. Then, some previous results are recovered as particular cases of the present results. As special cases, we give summation formulas of…
Various families of octonion number sequences (such as Fibonacci octonion, Pell octonion and Jacobsthal octonion) have been established by a number of authors in many different ways. In addition, formulas and identities involving these…
We establish some identities relating two sequences that are, as explained, related to the Tribonacci sequence. One of these sequences bears the same resemblance to the Tribonacci sequence as the Lucas sequence does to the Fibonacci…
Let (F_n^{(k)})_{n\geq -(k-2)} be the k-generalized Fibonacci sequence, defined as the linear recurrence sequence whose first k terms are \(0, 0, \ldots, 0, 1\), and whose subsequent terms are determined by the sum of the preceding k terms.…
We provide a formula for the $n^{th}$ term of the $k$-generalized Fibonacci-like number sequence using the $k$-generalized Fibonacci number or $k$-nacci number, and by utilizing the newly derived formula, we show that the limit of the ratio…
An Hadamard matrix is a square matrix $H\in M_N(\pm1)$ whose rows and pairwise orthogonal. More generally, we can talk about the complex Hadamard matrices, which are the square matrices $H\in M_N(\mathbb C)$ whose entries are on the unit…
The main purpose of this paper is to establish some new properties of Horadam numbers in terms of binomial sums. By that, we can obtain these special numbers in a new and direct way. Moreover, some connections between Horadam and…
We evaluate the nested sum $\sum_{a_{n - 1} = c}^{a_n } {\sum_{a_{n - 2} = c}^{a_{n - 1} } { \cdots \sum_{a_0 = c}^{a_1 } {x^{a_0 } } } }$ where $a_n$ and $c$ are any integers and $x$ is a real or complex variable. Consequently, we evaluate…
In this paper, we give several matrix representations for the Horadam quaternions. We derive several identities related to these quaternions by using the matrix method. Since quaternion multiplication is not commutative, some of our results…
We show that essentially the Fibonacci sequence is the unique binary recurrence which contains infinitely many three-term arithmetic progressions. A criterion for general linear recurrences having infinitely many three-term arithmetic…
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…