On Some Combinatorial Properties of Oresme Hybrationals

: In this paper, we study the Oresme hybrationals that generalize Oresme hybrid numbers and Oresme rational functions. We give a reccurence relation and a generating function for Oresme hybrationals. Moreover, we give some of their properties, among others, Binet formulas and general bilinear index-reduction formulas, through which we can obtain Catalan-, Cassini-, Vajda-, and d’Ocagne-type identities.


Introduction
The Fibonacci sequence, {F n } defined by F 0 = 0, F 1 = 1, and F n = F n−1 + F n−2 for n ≥ 2, is perhaps the most famous sequence in view of its connections with distinct areas of science, for example, Pascal's triangle [1][2][3], computer algorithm [4,5], graph theory [6], some problems of algebra [7], theoretical physics [8][9][10], and many other areas.This sequence has many interesting interpretations, applications, and generalizations, and based on them, a number of Fibonacci-like sequences were discovered.These generalizations have been given in many ways, some by preserving initial conditions or others by preserving the recurrence relations.In [11], Horadam introduced a generalized Fibonacci sequence, named later as the Horadam sequence, as follows.
For the integer n ≥ 0 Horadam sequence, W n = W n (W 0 , W 1 ; p, q) is defined by the recurrence relation In the next decade, Horadam extended Equation (1) considering rational numbers W 0 , W 1 , p, q, see [13].In particular, W n (0, 1 2 ; 1, 1  4 ) gives the well-known Oresme sequence {O n }.The sequence {O n } was introduced by Nicole Oresme in the 14th century, who found the sum of rational numbers formed by 0, 1  2 , 2 4 , 3  8 , 4  16 , 5 32 , 6 64 , . . ., n 2 n .These numbers form a sequence that can be defined by the recurrence relation 2 .Oresme numbers were generalized next by Cook in [14] in the following way.Let k ≥ 2 and n ≥ 0 be integers.Then, the k-Oresme numbers O (k) n , and In [15], the sequence of k-Oresme numbers was extended to the sequence of rational functions {O n (x)} adding to the definition of O (k) n a real variable x instead of an integer k.These rational functions were named in [15] Oresme polynomials, but by their rational form, we call them Oresme rational functions.
Let x ∈ R \ {0}.The sequence {O n (x)} of Oresme rational functions is recursively defined as follows: The first six terms of the Oresme rational function sequence are ( Solving the characteristic Equation r 2 − r + 1 x 2 = 0 of the Oresme rational functions recurrence relation, we obtain the Binet formula [15]), and for x 2 − 4 < 0, x = 0, (see for details [16]).The sequence {O n (x)} is a generalization of the Oresme sequence because of Sequences and polynomials of the Fibonacci-type also have applications in the theory of hypercomplex numbers.Many authors have studied these sequences in the context of quaternions, hybrid numbers, and others.For example in the survey [7], the bibliography contains over 100 papers, and most of them have been published quite recently.Motivated by these results, in this paper we use Oresme numbers and Oresme rational functions in the theory of hybrid numbers.We start with the necessary definitions.
In [17], Özdemir introduced a new noncommutative number system called hybrid numbers.The set of hybrid numbers, denoted by K, is defined by Two hybrid numbers The sum of two hybrid numbers is defined by 4), we obtain the following multiplication table.
Using the rules given in Table 2, the multiplication of hybrid numbers can be made analogously to the multiplications of algebraic expressions.The set of hybrid numbers is a noncommutative ring with respect to the addition and multiplication operations.
The Horadam hybrid sequence {H n }, where H n = W n + W n+1 i + W n+2 ε + W n+3 h, was defined and examined in [18].The Oresme hybrid sequence {OH n }, where OH n = O n + O n+1 i + O n+2 ε + O n+3 h, was introduced independently in [16,19] (see also [19]), while the k-Oresme hybrid numbers OH (k) n , where OH n+3 h, were introduced and studied in [16].The results for Fibonacci-type hybrid numbers were next generalized on Fibonacci-type hybrinomials; see the list [7].In [16], the authors defined a generalization of k-Oresme hybrid numbers and Oresme rational functions, named Oresme hybrationals.Properties and applications of k-Oresme hybrid numbers were studied in [20], published this year.
The results for Fibonacci-type hybrid numbers were next generalized on Fibonaccitype hybrinomials.
For n ≥ 0 and x ∈ R \ {0}, Oresme hybrationals are defined by where O n (x) is the nth Oresme rational function and i, ε, and h are hybrid units.For x = k, we obtain the k-Oresme hybrid numbers.This paper concerns Oresme hybrationals.We give a recurrence relation and a generating function for Oresme hybrationals.Moreover, we determine some identities for them, among others, Binet formulas and general bilinear index-reduction formulas.Using these formulas, we also obtain Catalan-, Cassini-, Vajda-, and d'Ocagne-type identities.It is worth mentioning that the domain for Oresme polynomials is symmetric with respect to 0. Moreover, due to the form of Binet's formulas for Oresme polynomials, the two symmetric points 2 and −2 are also considered separately.Therefore, when determining identities for Oresme hybrationals, we consider three different cases.

Results
In this section, we give some combinatorial properties of Oresme hybrationals.Let x ∈ R \ {0}.For future considerations we need initial conditions, which immediately follow from ( 5) and ( 2), of the form with OH 0 (x), OH 1 (x) given by (6).
If n ≥ 3, then using the definition of the Oresme rational functions, we have which ends the proof.
An important technique for solving linear homogeneous recurrence equations is generating functions.They are typically used with linear recurrence relations with constant coefficients, but they can be applied also for nonconstant coefficients.The next theorem gives the generating function for Oresme hybrationals.Theorem 2. Let x ∈ R \ {0}.Then, the generating function for the Oresme hybrational sequence Proof.Assume that the generating function of the Oresme hybrational sequence {OH n (x)} Multipling the above equality on both sides by −t and then by 1 . By adding the three equalities above, we obtain (7)), and the coefficients of t n for n ≥ 2 are equal to zero.Moreover, OH 0 (x) =

Properties of Oresme Hybrationals
In this subsection, we give a number of identities for Oresme hybrationals.As the Binet formula for Oresme rational functions depends on the value of x, some of them cannot be given for all x ∈ R \ {0}.First, we give equalities for all nonzero real variable x, and next, we consider cases x 2 − 4 > 0, x 2 − 4 < 0, x = 2, and x = −2.
Note that the cases mentioned above contain sets that are symmetric with respect to 0. Due to the form of Binet's formulas for Oresme polynomials, the two symmetric points 2 and −2 are also considered separately.Now, we describe the terms of the sequence {OH n (x)} explicitly using a Binet-type formula.Because the Binet formula for Oresme rational functions depends on x, we have to consider cases with respect to the sign of the expression x 2 − 4.
Proof.Using (8), we have which ends the proof.

Lemma 1. Let α
. Then, for x 2 − 4 > 0, we have Proof.By multiplication rules, we obtain Using the equalities we obtain and we obtain the equality (11).The proof of ( 12) is analogous, so we omit it.
Proof.Setting a = n + r, b = n − r, and c = d = n in (10), we have Moreover, putting the result follows.
If r = 1, then we obtain the Cassini-type identity.
For special values of a, b, c, d, we obtain the Vajda-and d'Ocagne-type identities, respectively.
The next results concern special cases k = 2 or k = −2, respectively.Because of the fact that they follow by simple calculations, we omit the proofs.Lemma 3 ([16,19]).(Binet-type formula) Let n ≥ 0 be an integer.Then,

Table 2 .
Multiplication rules for i, ε, and h.