The First Study of Mersenne--Leonardo Sequence
Abstract
Keywords
Binet’s formula , Generating function , Leonardo numbers , Mersenne numbers , Mersenne--Leonardo numbers
References
- [1] J. A. N. Sloane and others. The On-Line Encyclopedia of Integer Sequences. The OEIS Foundation Inc., (2024). https://oeis.org/
- [2] E. Deza. Mersenne numbers and Fermat numbers. World Scientific, 1 (2021).
- [3] J. S. Hall, A Remark on the Primeness of Mersenne Numbers, J. London Math. Soc., 1(3) (1953), 285–287.
- [4] B.A. Delello, Perfect Numbers and Mersenne primes, PhD thesis, University of Central Florida, 1986.
- [5] A. J. Gomes, E. A. Costa, R. A. Santos, Numeros perfeitos e primos de Mersenne, Revista da Olimpiada, IME-UFG, 7 (2008), 99–111.
- [6] D. Aggarwal, A. Joux, A. Prakash, Anupam, M. Santha, A new public-key cryptosystem via Mersenne numbers, Advances in Cryptology–CRYPTO 2018: 38th Annual International Cryptology Conference, (2018), 459–482.
- [7] C. J. L. Padmaja, V.S. Bhagavan, B. Srinivas, RSA encryption using three Mersenne primes, Int. J. Chem. Sci, 14(4) (2016), 2273–2278.
- [8] P. Catarino, H. Campos, Helena, P. Vasco, On the Mersenne sequence, Ann. Math. Inform., 46 (2016), 37–53.
- [9] M. Chelgham, A. Boussayoud, On the k-Mersenne-Lucas numbers, Notes Number Theory Discrete Math., 27(1) (2021), 7–13.
- [10] M. Mangueira, R. Vieira, F. Alves, P. Catarino, As generalizacoes das formas matriciais e dos quaternionos da sequencia de Mersenne, Rev. Mat. Univ. Fed. Ouro Preto., 1(1) (2021), 1–17.
