Binomial Transforms of the Padovan and Perrin Matrix Sequences

and Applied Analysis 3 We note that, fromDefinition 2 and (4) and (5), for n ≥ 0, we obtain


Introduction and Preliminaries
There are so many studies in the literature that are concernes about the special number sequences such as Fibonacci, Lucas, Pell, Jacobsthal, Padovan, and Perrin (see, e.g., [1][2][3][4] and the references cited therein).In Fibonacci numbers, there clearly exists the term golden ratio which is defined as the ratio of two consecutive of Fibonacci numbers that converges to  = (1 + √ 5)/2.It is also clear that the ratio has so many applications in, specially, physics, engineering, architecture, and so forth [5,6].In a similar manner, the ratio of two consecutive Padovan and Perrin numbers converges to that is named as plastic constant and was firstly defined in 1924 by Gérard Cordonnier.He described applications to architecture and illustrated the use of the plastic constant in many buildings.
Although the study of Perrin numbers started in the beginning of the 19th.century under different names, the master study was published in 2006 by Shannon et al. in [3].
The authors defined the Perrin {  } ∈N and Padovan {  } ∈N sequences as in the forms where respectively.
On the other hand, the matrix sequences have taken so much interest for different types of numbers (cf.[7][8][9]).For instance, in [7], authors defined new matrix generalizations for Fibonacci and Lucas numbers, and by using basic matrix approach they showed some properties of these matrix sequences.In [9], authors defined a new sequence which generalizes (, )-Fibonacci and (, )-Lucas sequences at the same time.After that, by using it, they established generalized (, )-matrix sequence.Finally, they presented some important relationships among this new generalization, (, )-Fibonacci and (, )-Lucas sequences and their matrix sequences.In [8], Gulec and Taskara gave new generalizations for (, )-Pell and (, )-Pell Lucas sequences for Pell and Pell-Lucas numbers.Considering these sequences, they defined the matrix sequences which have elements of (, )-Pell and (, )-Pell Lucas sequences.Also, they investigated their properties.Moreover, in [10], authors develop the matrix sequences that represent Padovan and Perrin numbers and examined their properties.
In addition, some matrix based transforms can be introduced for a given sequence.Binomial transform is one of these transforms, and there are also other ones such as rising and falling binomial transforms (see [11][12][13]).
Motivated by [10,12], the goal of this paper is to apply the binomial transforms to the Padovan (P  ) and Perrin matrix sequences (R  ).Also, the generating functions of these transforms are found by recurrence relations.Finally, the relations between these transforms are illustrated by deriving new formulas.Now, we give some preliminaries related to our study.Given an integer sequence  = { 0 ,  1 ,  2 , . ..}, the binomial transform  of the sequence , () = {  }, is given by In [10], for  ≥ 0, , authors defined Padovan and Perrin matrix sequences as in the form where ) , ) , ) , where ) , Proposition 1 (see [10]).Let one considers  ≥ 0, the following properties are held: (i) (ii) for  >  ≥ 0, the following statements are satisfied: (iii) for ,  ≥ 0, (a)

Binomial Transform of Padovan and Perrin Matrix Sequences
In this section, we will mainly focus on binomial transforms of Padovan and Perrin matrix sequences to get some important results.In fact, as a middle step, we will also present the recurrence relations, Binet formulas, summations, and generating functions.
Definition 2. Let P  and R  be the Padovan and Perrin matrix sequences, respectively.The binomial transforms of these matrix sequences can be expressed as follows: (i) the binomial transform of the Padovan matrix sequence is   = ∑  =0 (   ) P  , (ii) the binomial transform of the Perrin matrix sequence is We note that, from Definition 2 and ( 4) and ( 5), for  ≥ 0, we obtain The following lemma will be the key of the proof of the next theorems.Lemma 3.For  ≥ 0, the following equalities are held: Proof.Firstly, in here we will just prove (i), since (ii) can be thought in the same manner with (i).
(i) By using Definition 2 and the well known binomial equality we obtain which is a desired result.
From the previous Lemma, note that (i)  +1 also can be written as  +1 =   + ∑  =0 (   ) P +1 , (ii)  +1 also can be written as Theorem 4. For  > 0, with initial conditions ) , (ii) recurrence relation of sequences with initial conditions ) , ) . (16) Proof.Similarly for the proof of the previous theorem, only the first case (i) will be proved.We will omit the other cases since the proofs will not be different.(i) By considering the right-hand side of equality in (i) and Definition 2, we obtain By taking, account equality ( +1  ) = (  −1 ) = 0, we get From Lemma 3 and properties of binomial sum, we have On the other hand, by using ( 4) and the equality (  −1 ) = 0, we get which has completed the proof of this case.
The characteristic equation of sequences {  } and {  } in ( 13) and ( 15) is  3 − 3 2 + 2 − 1 = 0. Let  1 ,  2 , and  3 be the roots of this equation.Then, Binet's formulas of sequences {  } and {  } can be expressed as where ) , Abstract and Applied Analysis 5 Now, we give the sums of binomial transforms for Padovan and Perrin matrix sequences.
Theorem 5. Sums of sequences {  } and {  } are Proof.(i) By considering (9), we have Now, if we take  = 3, and  = 0 in first equality of Proposition 1-(ii), then we obtain Afterwards, by taking into account (4), we conclude (ii) The proof of the binomial transform of Perrin matrix sequences can be seen by taking into account (10), Proposition 1-(ii) and ( 5), similarly to the proof of (i).

Theorem 6. The generating functions of the binomial transforms for {P
(ii) Proof.We omit Padovan case since the proof will be quite similar.
Assume that () is the generating function of the binomial transform for {R  }.Then, we have Now, the rearrangement of the equation implies that which is equal to the ∑ ∞ =0     in theorem.Hence, the result is obtained.