#### Abstract

In this work, the Catalan transformation (CT) of -balancing sequences, , is introduced. Furthermore, the obtained Catalan transformation was shown as the product of lower triangular matrices called Catalan matrices and the matrix of -balancing sequences, , which is an matrix. Apart from that, the Hankel transform is applied further to calculate the determinant of the matrices formed from .

#### 1. Introduction

A balancing number is a positive integer that satisfies the Diophantine equation as follows:for some positive integer , called the balancer corresponding to . The -th balancing number is denoted by . For each , is a perfect square, and its positive square root is called a Lucas-balancing number . The balancing numbers are solutions of Pell’s equation , and its Binet formula is given bywhere and . Furthermore, the balancing numbers satisfy the recurrence relation as follows:with initial terms and .

There are several transformations that operate on various integer sequences. Some of them are Binomial Transform , Discrete Cosine Transform (DCT) , Laguerre Transform , Lah Transform , Discrete Wavelet Transform (DWT) , Discrete Fourier Transform (DFT), and Catalan Transform . In the real life processes, these transformations are basically utilized in various Steganographic schemes and techniques . In addition, there are numerous other usages of the above displayed transforms but despite that certain shortcomings of some of the transform techniques are still observed. For instance, the coefficients of the DCT are real-valued which makes the calculation very much time-consuming. Furthermore, the coefficients of DFT are, in general, complex numbers which generate complex value as output. In addition, the computational complexity of DFT is which also suggests that the transform is cumbersome and time-consuming. To overcome the shortcomings discussed regarding the different transformations, the Catalan transformation, introduced by Paul Barry  in 2005, proves to be a superior alternative. The reason behind CT being an appropriate substitute is due to the fact that unlike the earlier mentioned transformations, the overall calculation of Catalan transform is integer-based and not based on floating-point values which makes it very faster and reliable method of transformation. Furthermore, the computational complexity of Catalan transform is which also indicates a substantial improvement as we go from of DFT. Apart from the real life phenomena, the beneficial property of the Catalan transform makes it quite suitable to be applied for the derivation of important results relating to the properties of several integer sequences . Several classical core sequences, like the Fibonacci sequence , Pell sequence , and Jacobsthal sequence , can be paired by means of this transformation.

There are some research studies where the Catalan transform has been applied to the -Fibonacci sequences . Furthermore, the Catalan transform was applied to the -Jacobsthal sequence in . In , the Catalan transformation was applied to the -Lucas sequence. In addition, a new sequence realizing the known Lucas numbers has been discussed by Özkan et al. . In application point of view, Mukhopadhyay et al.  dealt with the secured image steganography via CT. In addition, the Lah transform has been applied for security data in the field of telecommunication in . The past literature depicts the Catalan transform of various sequences but it was observed that the balancing sequence was never been tackled via the Catalan transform which illustrates the novelty of the present work. Hence, in the present work, deriving motivation from the literature survey, we employed the Catalan transformation in case of the -balancing sequence , discussed in the later section, and inspected the properties of the sequences. Then, we apply the Hankel transform to the Catalan transform of .

The paper has been arranged in the following manner: first the preliminaries related to the -balancing sequence, Catalan numbers, Hankel transform, and Catalan transform are presented in Section 2. Furthermore, Section 3 is devoted towards the evaluation of Catalan transformation of the -balancing sequence. Apart from that, the generating function is calculated for the CT of -balancing sequence in Section 4. The next section deals with the Hankel transform of CT of -balancing numbers. The concluding remarks are mentioned in the final section.

#### 2. Preliminaries

##### 2.1. -Balancing Numbers

The -balancing numbers, denoted by , for any positive number , are defined by the recursive relation as follows :with the initial values and . Furthermore, the Binet formula for -balancing numbers is given bywhere and . Hence, the first few -balancing numbers are given by , , , , , , and so on. The -balancing numbers are tabulated in Table 1.

##### 2.2. Catalan Numbers

The Catalan numbers , termed after the French-Belgian mathematician named Eugne Charles Catalan, are defined as a sequence of natural numbers that are encountered in several counting problems and specifically occur where the items are defined recursively. They are denoted by and are further defined by , in terms of binomial coefficients, as

Furthermore, by virtue of , we have the recurrence relation of the Catalan numbers aswith , and its ordinary generating function is given by 

Furthermore, for some , the first few Catalan numbers  are given by (sequence A000108 in ):

##### 2.3. The Hankel Transform

By definition, the Hankel matrix of a sequence of real numbers is given by the infinite matrix as follows :

Furthermore, the Hankel transform  of a sequence of real numbers is defined as the sequence of determinants as follows:where is the Hankel matrix given by . Alternatively, it can be said that the Hankel transform produces the sequence of determinants of the Hankel matrices formed from the known or given sequence. Furthermore, the Hankel transform of the Catalan sequence is given by the sequence as given in . In addition, the Hankel transform of the sum of consecutive generalized Catalan numbers is the bisection of the classical Fibonacci sequence .

Lemma 1. The Hankel transform of a sequence is invariant under the binomial transform of that sequence. In other words, if we write the binomial transform of a given sequence asthen

Proof. The proof of the lemma can be referred from .

##### 2.4. The Catalan Transformation

Definition 1. The Catalan transformation, as introduced in , is a sequence transform which is defined as follows.
Let us consider to be a sequence with generating function as follows:Then, the Catalan transformation of is defined to be the sequence whose ordinary generating function (o.g.f.) is given by , where is the series as defined in (8) . The Catalan transformation is also linked to various known transforms, particularly the binomial transformation.

Lemma 2. The Catalan transformation of a given sequence is given by

Proof. The proof of the lemma can be referred from .

#### 3. Catalan Transformation of the -Balancing Sequence

By virtue of Lemma 2, we define the Catalan transformation of the -balancing sequence, , aswith . Hence, it can be observed that the members of Catalan transform of the first -balancing numbers are the polynomials in given by

Furthermore, we can write the above equations as the product of a lower triangular matrix say and a matrix which is depicted as

The elements of matrix satisfy the recursive relation given by

Furthermore, the first and second column of are equal for , denoting the Catalan numbers. In addition to it, the lower triangular matrix denoted by is known as the Catalan triangle and its entries satisfy the relation as follows :

Hence, the Catalan triangle is obtained via the coefficients of the Catalan transform of the -balancing sequence and is given by the figure in Table 2.

In addition, we obtain the first few terms of the series of Catalan transform of the -balancing sequence as follows:

#### 4. Generating Function of the Catalan Transform of -Balancing Sequence

The generating functions (g.f.s), initially introduced by Abraham de Moivre, are a step to encode an infinite sequence of numbers via treating them as the coefficients of a power series. In other words, the problems about sequences can be transformed into problems about functions by means of the generating functions. Now, in this case, we find the generating function of the Catalan transformation of the -balancing sequence and denote it by . By virtue of (8), we have the generating function of the Catalan numbers as . Furthermore, by virtue of , it can be clearly observed that is the generating function of the Catalan transform of any sequence . Hence, by means of the g.f. of the -balancing sequence in , we have

#### 5. Hankel Transform of Catalan Transform of -Balancing Numbers

In the present section, we find the Hankel transform of the Catalan transform of -balancing numbers in the form of determinants of Hankel matrices. By considering the Catalan transform of the -balancing sequence of the preceding section, we obtain the following:

#### 6. Conclusion

In the present study, the Catalan transformation is applied to the -balancing sequence and some identities are obtained. The identities were further represented in matrix form, and the terms of the CT of -balancing sequence are displayed. Apart from that, the Catalan triangle is obtained by means of the coefficients of the Catalan transform of the -balancing sequence. In addition, the generating function of CT of the sequence is manifested. Finally, the Hankel transform is utilized to the Catalan transformation of the known -balancing sequence.

#### Data Availability

No data were used to support this study.

#### Conflicts of Interest

The authors declare that they have no conflicts of interest.

#### Authors’ Contributions

Asim Patra actualized the study, prepared the initial draft, developed methodology, validated the study, and edited the manuscript. Mohammed K. A. Kaabar actualized the study, validated the study, was responsible for resources, supervised the original draft, and edited the manuscript. All authors have taken equal part in this research, and they have read and approved the final manuscript.