In this work, we define a new generalization of the Leonardo sequence by the recurrence relation $GLe_n=aGLe_{n-1}+GLe_{n-2}+a$ (for even $n$) and $GLe_n=bGLe_{n-1}+GLe_{n-2}+b$ (for odd $n$) with the initial conditions $GLe_0=2a-1$ and $GLe_1=2ab-1$, where $a$ and $b$ are real nonzero numbers. Some algebraic properties of the sequence $\{GLe_n\}_{n \geq 0}$ are studied and several identities, including the generating function and Binet's formula, are established.
11 February 2021 in Trends in Computational and Applied Mathematics
In this paper we investigate the generalized Pell numbers of order r ≥ 2 through the properties of their related fundamental system of generalized Pell numbers. That is, the generalized Pell number of order r ≥ 2; are expressed as a linear combination of a fundamental system of generalized Pell numbers. The properties of this fundamental system are examined and results can be established for generalized Pell numbers of order r ≥ 2. Some identities and combinatorial results are established. Moreover, the analytic study of the fundamental system of generalized Pell is provided. Furthermore, the generalized Pell Cassini identity type is provided.
The tradition of studies involving the combinatorial approach to recurring numerical sequences has accumulated a few decades of tradition, and several problems continue to attract the interest of mathematicians in several countries. This work specifically discusses the Fibonacci, Pell, and Jacobsthal sequences, focusing on Mersenne sequences. The often-used definition of board involves considering how to fill a specific regular surface -the board- with a limited quantity of regularly shaped tiles. On the other hand, an analogous problem can be generalized and exemplifies current research developments. Finally, the examples covered constitute unexpected ways of exploring visualization and other skills in mathematics teachers’ learning, consequently inspiring them for their teaching context.
In this study, we investigate some new properties of the sequence of bi-periodic Fibonacci numbers with arbitrary initial conditions, through an approach that combines the matrix aspect and the fundamental Fibonacci system. Indeed, by considering the properties of the eigenvalues of their related matrix, we provide a new approach to studying the analytic representations of these numbers. Moreover, the similarity of the associated matrix with a companion matrix, allows us to formulate the bi-periodic Fibonacci numbers in terms of a homogeneous linear recursive sequence of the Fibonacci type. Therefore, the combinatorial aspect and other analytic representations formulas of the Binet type for the bi-periodic Fibonacci numbers are achieved. The case of bi-periodic Lucas numbers is outlined, and special cases are exposed. Finally, some illustrative examples are given.