1. Preliminaries and Background
For some years now, many numerical sequences have attracted the attention and curiosity of various researchers. The best known is the famous Fibonacci sequence, , defined by the recurrence , with initial conditions and . Many generalizations of Fibonacci numbers have been considered in recent years. One of them is the Lucas numbers, denoted by , defined by the same recurrence relation of Fibonacci, but with different initial conditions given by and .
Another important sequence, closely related to the Fibonacci sequence, is the Pell sequence. The Pell sequence, denoted by
, is a sequence of integers that was first studied by mathematician John Pell in the 17th Century and is defined by the recurrence relation
, with initial conditions
and
[
1,
2]. These numbers have many interesting properties and have been studied in various fields such as number theory and combinatorics. For example, Pell numbers can be used to solve certain combinatorial enumeration problems and to find square triangular numbers. For those interested in learning more about number sequences, you can consult the encyclopedia [
3]; for applications of these numbers and their relatives, you can consult the books [
4,
5].
Many variations of the Pell and Fibonacci sequences have been studied, such as Pell–Lucas sequences, denoted by , which are characterized by the same linear recurrence of Pell numbers, but with different initial conditions, namely , with initial conditions and .
In general, research on numerical sequences advances by considering generalizations such as arbitrary coefficients, arbitrary initial conditions, or the extension of an index to integers. For each generalization considered, it is interesting to find closed formulas of the Binet type, or the generating function, in order to seek better mechanisms for computing it without using recurrence. It is also interesting to look for identities that involve them and study their growth and convergence.
Still on Fibonacci and Pell numbers, and their generalizations, we would like to highlight some articles to better contextualize the sequence that we will define and work on here. The
k-Fibonacci numbers were studied in [
6] and defined by
with
and
Similarly, a generalization for Pell numbers,
k-Pell numbers, was introduced by the second author in [
7], denoted by
and defined by
with
and
Other important generalizations are the
k-Pell–Lucas,
and Modified
k-Pell,
, defined, respectively, by the recurrences relations
with
and
as the respective initial conditions.
These sequences were investigated, and several results, such as the Binet formula, generating functions, Cassini’s identities, as well as the matrix approach were established (see more about these sequences in [
7,
8,
9,
10,
11,
12] and the references therein).
Now, consider the results given by Dil and Mező in [
13]. The authors introduced a symmetric algorithm obtained by the recurrence relation
and studied a generalization of the Fibonacci and Lucas numbers, the hyper Fibonacci numbers and hyper Lucas numbers, as an application of the results obtained with the symmetric algorithm. The sequence of hyper Fibonacci numberswas defined as
for non-negative integers
n and
r, with initial conditions
and
Motivated by the hyper Fibonacci numbers, in [
14] was introduced the “hyper” approach for the
k-Pell,
k-Pell–Lucas, and Modified
k-Pell sequences. The authors established some properties and discussed the concavity, convexity, log-concavity, and log-convexity properties for these sequences.
On the other hand, there is a natural extension that we can make to numerical sequences, considering the numerical set in which its elements are inserted. Different number systems have been studied, and the relationship with numerical sequences has been explored. Horadan in [
15] introduced the first extension of this type by defining the Fibonacci numbers in the complex and quaternions number systems. Horadam introduced the concept of complex Fibonacci numbers as the Gaussian Fibonacci sequence
defined by
with initial conditions
and
where
i is the imaginary unit
and
is the
n-th Fibonacci number (for instance, see more in [
16]). It was shown that
, and motivated by this equality, the Fibonacci quaternions were introduced, defined by the recurrence relation
where
are units with the properties
and
is the
n-th Fibonacci number.
Complex, hyperbolic, and dual-numbers are two-dimensional systems that have been studied extensively over the last century for their potential applications in various fields. In the realm of Physics, these numbers are used to represent space–time through the concept of a hyper complex ring. This suggests that space–time can be seen as a structure created by the algebra of hybrid numbers. In other words, the study of hybrid numbers can help us understand and explain all types of space–times (for instance, see [
17]).
The hybrid number system was introduced by Özdemir in [
18]. A hybrid number can be viewed as a generalization of the complex, hyperbolic, and dual-number. The set of hybrid numbers, denoted by
, is defined as
The addition of hybrid numbers is performed componentwise, and this operation is commutative and associative, while the multiplication is not commutative, but has the property of associativity. For more details related to this number system, see the work developed by Özdemir in [
18], where the author examined this new ring of numbers, which is non-commutative and has the unit element. The sequences of hybrid numbers are studied from several perspectives using, for example, the analytic and matrix approach (see [
19,
20] and the references therein). It is important to highlight hybrid Fibonacci numbers here. This sequence was introduced by Szynal-Liana and Wloch in [
19]. The authors derived some properties using classical Fibonacci identities. The “hybrid” version of the Pell, Pell–Lucas, and Jacobsthal numbers was considered by the same authors (see, for instance [
21,
22,
23]).
Consider the hyper
k-Pell, the hyper
k-Pell–Lucas, and the hyper Modified
k-Pell numbers that were introduced by Catarino, Alves, and Campos in [
14]. Some properties and identities satisfied by these sequences are present in [
14]. In this paper, it is our intention to introduce new sequences that are the “hybrid version” of them.
In order to study these new sequences, we need to study other properties, generating functions, and Binet’s formula of the hyper
k-Pell, hyper
k-Pell–Lucas, and hyper Modified
k-Pell sequences, which will be stated in the next section. The last section is dedicated to the new sequences, which were the subject of a study motivated by the work of Yasemin in [
24] with the hybrid hyper Fibonacci and hybrid hyper Lucas numbers.
2. “Hyper” Version of the -Pell, -Pell–Lucas, and Modified -Pell Numbers
As we have mentioned before, in this section, we recall the hyper
k-Pell,
k-Pell–Lucas, and Modified
k-Pell sequences introduced in [
14] and present some properties that will be necessary for the study of the new sequences introduced in the next section of this paper.
For non-negative integers
, and
k, the
n-th term of the hyper
k-Pell, hyper
k-Pell–Lucas, and hyper Modified
k-Pell sequences is defined, respectively, as follows:
and
It is clear that taking
in (
4)–(
6), the
k-Pell given by (
1),
k-Pell–Lucas given by (
2), and Modified
k-Pell numbers given by (
3) are obtained, respectively.
2.1. Some Properties of These Sequences
This subsection is dedicated to introducing some properties that are satisfied by the sequences and , which will be necessary for the study of the new numerical sequences that will be introduced in the next section.
Given the recurrence relation (
1) of
k-Pell numbers, we immediately derive the recurrence relation for
that coincides with the recurrence relation of the sequence of
k-Pell numbers. Also, we can obtain the recurrence relation for
. In fact, taking into account the recurrence (
1) and the initial conditions of the
k-Pell sequence, we obtain:
In a similar process, using the previous recurrence relation and the initial conditions, the recurrence relation for is given by .
Under the previous discussion, we have the next result.
Proposition 1. For and a non-negative integer k, the following recurrence relations hold: For the statement of the general case, consider the following lemma given in [
25].
Lemma 1 (Lemma 2.1 [
25]).
Consider the arithmetic progression defined by for all non-negative integers Consider the arithmetic progression of order defined by the partial sums of the arithmetic progression of order Then, the sequence is given by the polynomial of degree for and For the general case, we have:
Proposition 2. For a non-negative integer k and positive integers and , the hyper k-Pell sequence satisfies the recurrence relation: Proof. We used induction on
r. For
and
, the result derives from the previous proposition. Now, suppose that this statement is valid for all positive integers less than or equal to
r, and we will show that this holds for
. In fact,
and by Lemma 1, the result follows. □
Using similar reasoning to that used for the recurrence relations in the cases of
in
, for the sequences defined in (
5) and (
6), we have the following result, whose proof we omit:
Proposition 3. For and a non-negative integer k, the following recurrence relations hold:with and as the respective initial conditions. The third item of Proposition 3 in [
14] established the following relation:
Then, by Proposition 2, it is verified that
Similarly, the second item of Proposition 3 in [
14] established the following relation:
Then, by Proposition 2, it is verified that
Under the previous discussion, we can establish the following recurrence relations.
Proposition 4. For integer numbers , and , the hyper k-Pell–Lucas and the hyper Modified k-Pell sequences satisfy the recurrence relations:with , and Propositions 1–4 give us the recurrence relations for the hyper k-Pell, hyper k-Pell–Lucas, and hyper Modified k-Pell sequences. The recurrence relations allow us to study the generating functions and the Binet formula, by providing the explicit formulas for the hyper k-Pell, hyper k-Pell–Lucas, and hyper Modified k-Pell sequences.
2.2. The Generating Function and Binet’s Formula
Next, we shall give the generating functions for the hyper k-Pell, hyper k-Pell–Lucas, and hyper Modified k-Pell sequences. We shall write such a sequence as a power series where each term of the sequence corresponds to the coefficients of the series. Considering these sequences, the generating functions , , and are defined, respectively, by , and
Theorem 1. For non-negative integers , and r, the generating functions for the hyper k-Pell, hyper k-Pell–Lucas, and hyper Modified k-Pell sequences are, respectively, Proof. Since
, then, with some more calculations, we obtain the desired result. The proof of the identity (
16) can be performed in a similar way to what we have just shown, taking into account the respective initial conditions. As for the last generating function, all we have to do is look at Item 1 of Proposition 3 in [
14], and the result follows immediately. □
In what follows, we will present the Binet formula for these numerical sequences. Thus, we have:
Theorem 2. For non-negative integers , and r, the following identities holdwhere and are constants for each obtained by solving the equation:for each fixed and are obtained by solving the Vandermonde system with initial conditions and Proof. In order to prove (
19), consider Expression (
10), whose characteristic equation is nonhomogeneous. The respective solutions are the sum of the solutions of the homogeneous part of (
10) and a particular solution. Consider the homogeneous part of (
10) and the associated characteristic equation
. The roots of
are simply given by
and
. Then, the solutions of the homogeneous part of (
10) is under the form
, where
and
By fixing
r and considering
a particular solution is given by
where
are constants for each
obtained by solving the equation
Given the particular solution, by replacing we obtain the associated homogeneous recurrence relation the closed formula of which is given by where , and are obtained by solving the Vandermonde system with the initial conditions and □
For we obtain the function then the particular solution is given by constant Therefore, the next result is verified.
Corollary 1. For non-negative integers n and the n-th hyper k-Pell number of order one is given aswhere and Similarly, the results of Proposition 4 give us the Binet formula for the hyper k-Pell–Lucas and hyper Modified k-Pell numbers.
Theorem 3. For non-negative integers , and r, the following identities hold:where is the particular solution and are constants obtained by solving the Vandermonde system with initial conditions and and and respectively. 3. “Hybrid Hyper” Version of the -Pell, -Pell–Lucas, and Modified -Pell Numbers
In this section, motivated by the conception of “hybrid” and “hyper” for each sequence of k-Pell, k-Pell–Lucas, and Modified k-Pell numbers, we present the following definition:
Definition 1. For non-negative integers , and k, the n-th hybrid hyper k-Pell, k-Pell–Lucas, and Modified k-Pell numbers are defined, respectively, as follows:where is the n-th hyper k-Pell number given by Expression (4):where is the n-th hyper k-Pell–Lucas number given by Expression (5), andwhere is the n-th hyper Modified k-Pell number given by Expression (6). Observe that, for , we have that is the n-th hybrid k-Pell number, is the n-th hybrid k-Pell–Lucas number, and is the n-th hybrid Modified k-Pell number.
3.1. Some Properties of These Sequences
In this subsection, we will study some properties of the hybrid hyper
k-Pell, hybrid hyper
k-Pell–Lucas, and hybrid hyper Modified
k-Pell numbers. Several identities of the hyper
k-Pell, hyper
k-Pell–Lucas, and hyper Modified
k-Pell numbers were established in [
14] and can be extended to the hybrid hyper
k-Pell, hybrid hyper
k-Pell–Lucas, and hybrid hyper Modified
k-Pell numbers. First, consider the result of Proposition 1 in [
14]:
Then, by replacing Expression (
30) in Expression (
27), we obtain
Similarly, the result can be provided for the hybrid hyper k-Pell–Lucas and the hybrid hyper Modified k-Pell sequences. The following proposition gives us these formulas.
Proposition 5. For non-negative integers k, , and , the hybrid hyper k-Pell, hybrid hyper k-Pell–Lucas, and hybrid hyper Modified k-Pell sequences satisfy the recurrence relations: As a consequence, for , we obtain the following corollary.
Corollary 2. For , the identities below hold:where is the n-th hybrid k-Pell number, is the n-th hybrid k-Pell–Lucas number, and is the n-th hybrid Modified k-Pell number. Using Definition 1, Corollary 2, and the identities of Proposition 2 in [
14], we can describe a different expression for the hybrid hyper
k-Pell, hybrid hyper
k-Pell–Lucas, and hybrid hyper Modified
k-Pell sequences, for
whose proofs will be omitted.
Proposition 6. For non-negative integers k, , and , the hybrid hyper k-Pell, hybrid hyper k-Pell–Lucas, and hybrid hyper Modified k-Pell sequences satisfy the identities below:where is the n-th hybrid k-Pell number, is the n-th hybrid k-Pell–Lucas number, and is the n-th hybrid Modified k-Pell number. Using the results of
Section 2.1, we will provide a recursive relation for the hybrid hyper
k-Pell,
k-Pell–Lucas, and Modified
k-Pell numbers. By replacing Expression (
10) in Expression (
27), we obtain
where
Observe that the initial values can be determined by replacing
and
in Expression (
27), given by
and
Similarly, by replacing Expression (
13) in Expression (
28) and Expression (
14) in Expression (
29), we obtain the following result.
Proposition 7. For non-negative integers k, , and , the hybrid hyper k-Pell, the hybrid hyper k-Pell–Lucas, and hybrid hyper Modified k-Pell sequences satisfy the recurrence relations:with initial conditions and with initial conditions and andwith initial conditions and where and Proposition 7 shows us that the hybrid hyper k-Pell, hybrid hyper k-Pell–Lucas, and hybrid hyper Modified k-Pell sequences can be see as a nonhomogeneous linear recurrence relation of order 2. These results allow us to provide the generating function and the Binet formula for these sequences.
3.2. The Generating Function and Binet’s Formula
Motivated by the results in
Section 2.2, this subsection is devoted to establishing the generating function and the Binet formula for the hybrid hyper
k-Pell, hybrid hyper
k-Pell–Lucas, and hybrid hyper Modified
k-Pell sequences.
Consider that the generating functions
,
, and
are defined, respectively, by
, and
We have
Taking into account the respective initial conditions, we can provide the generating function for the hybrid hyper
k-Pell–Lucas and hybrid hyper Modified
k-Pell sequences. We have
Under the previous discussion, the next result is established.
Theorem 4. For non-negative integers , and k, the generating functions for the hybrid hyper k-Pell, hybrid hyper k-Pell–Lucas, and hybrid hyper Modified k-Pell sequences are, respectively,where is given by Expression (34) and is given by Expression (35). Proposition 7 shows that the hybrid hyper k-Pell, hybrid hyper k-Pell–Lucas, and hybrid hyper Modified k-Pell sequences are defined by nonhomogeneous linear recurrence relations. Then, by fixing r and by considering a particular solution given by we obtain the associated homogeneous recurrence relation the closed formula of which is given by where and are obtained by solving the Vandermonde system with initial conditions and
Theorem 5. For non-negative integers , and r, the following identities hold:where and where are constants for each obtained by solving the equation:for each fixed and are obtained by solving the Vandermonde system with initial conditions and Theorem 6. For non-negative integers , and r, the following identities hold:where and where and where are constants for each obtained by solving the equation:for each fixed and are obtained by solving the Vandermonde system with initial conditions and Theorem 7. For non-negative integers , and r, the following identities hold:where and where and where are constants for each obtained by solving the equationfor each fixed and are obtained by solving the Vandermonde system with initial conditions and 4. Conclusions
In this paper, we established some properties and identities involving the hyper k-Pell, hyper k-Pell–Lucas, and hyper Modified k-Pell numbers, as recurrence relations, generating functions, and the Binet formula. In addition, we presented the hybrid hyper k-Pell, hybrid hyper k-Pell–Lucas, and hybrid hyper Modified k-Pell numbers, which consist of a new generalization of the hyper k-Pell, hyper k-Pell–Lucas, and hyper Modified k-Pell numbers. Moreover, the algebraic properties of these sequences were studied, and also, the generating function, Binet formula, and several identities were provided.
It seems to us that all the results given here are new in the literature, and these new sequences of numbers are a subject that can still be studied in several aspects.