Related papers: A Three-by-Three matrix representation of a genera…
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…
In this paper, we define a variant of Fibonacci-like sequences that we call prime Fibonacci sequences, where one takes the sum of the previous two terms and returns the smallest odd prime divisor of that sum as the next term. We prove that…
Using the lattice paths in $\mathbb{N}\times\mathbb{N}$, we derive a general formula for sequences $\big(T(n,k)\big)$ satisfying the recurrence relation of the form: \begin{equation*} T((n,k)=a_{n,k}T(n-1,k)+b_{n,k}T(n-1,k-1).…
Recently, Cerda-Morales \cite{Ce6} introduced commutative matrices derived from the third-order Jacobsthal matrix sequence and the third-order Jacobsthal--Lucas matrix sequence. In the present work, through the identification of certain…
The sequence $F_{dn+h}$ and its convolutions have (for $h=0$) been studied in a recent paper at the arxiv [arXiv:2603.08636]. The instance with general $h$ is more involved and uses Chebyshev polynomials.
We define recursive harmonic numbers as a generalization of harmonic numbers. The table of recursive harmonic numbers, which is like Pascal's triangle, is constructed. A formula for recursive harmonic numbers containing binomial…
Number sequences defined by a linear recursion relation are studied by means of generating functions. Indices of the terms in the recursion relation have arbitrary differenses. In addition to formulas for the nth term an algorithm is…
We define recurrence matrices and study a few properties (links with automatic sequences, branch groups etc.) of them.
This article examines matrices whose entries are determined by recursive relations of the form $A_{i, j} = x A_{i, j-1} + y A_{i-1, j-1} + z A_{i-1, j}$, where $x, y, z$ are constants, and the initial conditions are defined along the first…
We speculate on the distribution of primes in exponentially growing, linear recurrence sequences $(u_n)_{n\geq 0}$ in the integers. By tweaking a heuristic which is successfully used to predict the number of prime values of polynomials, we…
In this paper, we construct Pell matrices, analogous to Fibonacci matrices, to study algebraic properties of Pell numbers via linear algebra. This framework yields identities involving the trace, inverse, and determinant, as well as matrix…
Collatz conjecture is generalized to $3n+3^k$ ($k\in N$). Operating as usual, every sequence seems to reach $3^k$ and end up in the loop $3^k, 4.3^k, 2.3^k,3^k$. The usual $3n+1$ conjecture is recovered for $k=0$. For $k>0$, we noticed the…
The purpose of this article is to bring together the third-order Jacobsthal numbers and 3-parameter generalized quaternions, which are a general form of the quaternion algebra according to 3-parameters. With this purpose, we introduce and…
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…
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…
A definition for functions of multidimensional arrays is presented. The definition is valid for third-order tensors in the tensor t-product formalism, which regards third-order tensors as block circulant matrices. The tensor function…
Ordinary binary multiplication of natural numbers can be generalized in a non-trivial way to a ternary operation by considering discrete volumes of lattice hexagons. With this operation, a natural notion of `3-primality' -- primality with…
This paper describes a class of sequences that are in many ways similar to Fibonacci sequences: given n, sum the previous two terms and divide them by the largest possible power of n. The behavior of such sequences depends on n. We analyze…
To approximate a simple root of an equation we construct families of iterative maps of higher order of convergence. These maps are based on model functions which can be written as an inner product. The main family of maps discussed is…
A Redheffer--type matrix with Fibonacci entries is defined, and the determinant and spectral properties of this matrix are studied. Also, more general Redheffer--type matrices are considered and intriguing number-theoretic examples are…