This article introduces and investigates a new integer sequence, termed the higher-order Mersenne sequence, defined in analogy with higher-order Fibonacci numbers and closely related to classical Mersenne numbers. We establish a range of fundamental algebraic properties of this sequence, including its Binet-type formula, Catalan’s identity, d’Ocagne’s identity, generating function, and several finite and binomial summation identities. Further, we explore its connections with both Mersenne and Jacobsthal numbers. The study also examines the sequence obtained via the binomial transform of higher-order Mersenne numbers, deriving its recurrence relation and algebraic characteristics. In addition, matrix generators and a tridiagonal matrix representation are developed to enrich the structural understanding of these numbers.
Binomial sums Binomial transform Generating functions Matrix generators Mersenne numbers Partial sums Recurrence relations
| Primary Language | English |
|---|---|
| Subjects | Mathematical Methods and Special Functions, Complex Systems in Mathematics, Approximation Theory and Asymptotic Methods, Applied Mathematics (Other) |
| Journal Section | Research Article |
| Authors | |
| Submission Date | October 5, 2025 |
| Acceptance Date | November 30, 2025 |
| Early Pub Date | December 9, 2025 |
| Publication Date | December 15, 2025 |
| Published in Issue | Year 2025 Volume: 13 Issue: 4 |