2013
DOI: 10.12988/imf.2013.38164
|View full text |Cite
|
Sign up to set email alerts
|

A note involving two-by-two matrices of the k-Pell and k-Pell-Lucas sequences

Abstract: We use a diagonal matrix for getting the Binet's formula for k-Pell sequence Also the n th power of the generating matrix for k-Pell-Lucas sequence is established and basic properties involving the determinant allow us to obtain its Cassini's identity.Mathematics Subject Classification: 11B37, 05A15, 11B83.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
18
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 17 publications
(19 citation statements)
references
References 10 publications
1
18
0
Order By: Relevance
“…Now using Proposition 4 of [2] we have exactly the same as in (15). Now we will consider the Hadamard product, denoted by •, of the previously defined matrices, that is the entrywise product, see [8].…”
Section: Some Identitiesmentioning
confidence: 98%
See 1 more Smart Citation
“…Now using Proposition 4 of [2] we have exactly the same as in (15). Now we will consider the Hadamard product, denoted by •, of the previously defined matrices, that is the entrywise product, see [8].…”
Section: Some Identitiesmentioning
confidence: 98%
“…Proposition 3 of [2] is required to obtain vi) and Proposition 4 of the same article to obtain vii).…”
Section: Some Identitiesmentioning
confidence: 99%
“…where c 0 , c 1 · · · c p−1 are real constants and for detailed illustration about the generating matrix one can see [11]. If we put p = 2 in (3.1) we get a n+2 = c 1 a n+1 + c 0 a n and after that if we recall recurrence (2.1) and take c 0 = 1 and c 1 = k then the matrix associated called generating matrix is given by…”
Section: Generating Matrix For the Generalized Kfibonacci Sequencementioning
confidence: 99%
“…In [11] author used the same concept as in [1] and studied the k-PellLucas sequences by matrix methods.…”
Section: Introductionmentioning
confidence: 99%
“…In these cases, for ݊ 1, we have, respectively, the following: ܲ ,ାଵ ൌ 2ܲ , + kܲ ,ିଵ , ܲ , ൌ 0, ܲ ,ଵ ൌ 1; ܳ ,ାଵ ൌ 2ܳ , + kܳ ,ିଵ , ܳ , ൌ ܳ ,ଵ ൌ 2; ‫ݍ‬ ,ାଵ ൌ ‫ݍ2‬ , + k‫ݍ‬ ,ିଵ , ‫ݍ‬ , = ‫ݍ‬ ,ଵ ൌ 1. For more detail about these sequences, see the works of Catarino [7], [11] and Catarino and Vasco [8], [9] and [10].…”
Section: Introductionmentioning
confidence: 99%