2021
DOI: 10.34198/ejms.8122.83120
|View full text |Cite
|
Sign up to set email alerts
|

On Generalized p-Mersenne Numbers

Abstract: In this paper, we introduce the generalized p-Mersenne sequence and deal with, in detail, two special cases, namely, p-Mersenne and p-Mersenne-Lucas-sequences. We present Binet’s formulas, generating functions, Simson formulas, and the summation formulas for these sequences. Moreover, we give some identities and matrices related with these sequences.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
3
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 21 publications
(21 reference statements)
0
3
0
Order By: Relevance
“…The sums of squares of generalized Fibonacci number and Tribonacci number [2][3][4] . Likewise, a study on Generalized Mersenne numbers by Soykan Y 5 . Now look into sums of squares of 'm' consecutive carol numbers and its matrices representation starting with 7, every third carol numbers is multiple of 7.…”
Section: Introductionmentioning
confidence: 99%
“…The sums of squares of generalized Fibonacci number and Tribonacci number [2][3][4] . Likewise, a study on Generalized Mersenne numbers by Soykan Y 5 . Now look into sums of squares of 'm' consecutive carol numbers and its matrices representation starting with 7, every third carol numbers is multiple of 7.…”
Section: Introductionmentioning
confidence: 99%
“…The generalized Mersenne number has been introduced and dealt with two special cases, namely, Mersenne and Mersenne-Lucas sequences (10) . They discussed the Binet's formulas, generating functions, Simson formulas, and the summation formulas for these sequences.…”
Section: Introductionmentioning
confidence: 99%
“…The Mersenne and Mersenne-Lucas sequences have been discussed as two particular examples of the generalized Mersenne number (9) . They spoke about the generating functions, Simson formulae, Binet formulas, and summation formulas for these sequences.…”
Section: Introductionmentioning
confidence: 99%