Next Article in Journal
Balancing Privacy and Robustness in Prompt Learning for Large Language Models
Previous Article in Journal
Model for Predicting Maize Crop Yield on Small Farms Using Clusterwise Linear Regression and GRASP
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On the Incomplete Edouard and Incomplete Edouard–Lucas Numbers

by
Elen Viviani Pereira Spreafico
1,*,†,
Eudes Antonio Costa
2,† and
Paula Catarino
3,†
1
Institute of Mathematics, Federal University of Mato Grosso do Sul, Campo Grande 79060-300, Brazil
2
Department of Mathematics, Federal University of Tocantins, Arraias 77330-000, Brazil
3
Department of Mathematics, University of Trás-os-Montes e Alto Douro, 5001-801 Vila Real, Portugal
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Mathematics 2024, 12(21), 3357; https://doi.org/10.3390/math12213357
Submission received: 14 September 2024 / Revised: 18 October 2024 / Accepted: 24 October 2024 / Published: 26 October 2024

Abstract

:
This study introduces two new sequences: the incomplete Edouard and the incomplete Edouard–Lucas numbers. In addition, we establish some of the properties, identities, and recurrence relations of these sequences. The relations of these new sequences with balancing, Lucas-balancing, incomplete balancing, and incomplete Lucas-balancing numbers are explored, and some new identities are provided. Moreover, the functions for generating the incomplete Edouard and incomplete Edouard–Lucas numbers are stated.

1. Introduction

Sequences of integers are interesting because of their applications in several areas. Therefore, numerous sequences have been introduced and studied. Two of them, which are the central theme of this article, were introduced by Soykan in the article [1] and are called the sequence of Edouard numbers { E n } n 0 and sequence of Edouard–Lucas numbers { K n } n 0 . In [1], the author established the Binet formulas, generating functions, and some of the identities of the these recently published sequences of numbers.
The sequence of Edouard numbers { E n } n 0 and the sequence of Edouard–Lucas numbers { K n } n 0 are given by the third-order recurrence relations and initial conditions
E n = 7 E n 1 7 E n 2 + E n 3 , E 0 = 0 , E 1 = 1 , E 2 = 7 ,
K n = 7 K n 1 7 K n 2 + K n 3 , K 0 = 3 , K 1 = 7 , K 2 = 35 ,
respectively. Relations (1) and (2) can be rewritten as non-homogeneous relations, as given below:
E n = 6 E n 1 E n 2 + 1 , E 0 = 0 , E 1 = 1 ,
K n = 6 K n 1 K n 2 4 , K 0 = 3 , K 1 = 7 .
These sequences are new to the literature and the motivation for their study is the interesting fact that they have a closed connection with balancing numbers. The concept of balancing numbers was first introduced by Behera and Panda [2] in the year 1999 in connection with a Diophantine equation. It consists of finding a natural number n such that 1 + 2 + 3 + ( n + 1 ) = ( n + 1 ) + ( n + 2 ) + + ( n + r ) for some other natural number r . The sequence of balancing numbers is denoted by { B n } n 1 . In [2], Behera and Panda first obtained the recurrence relation
B n + 1 = 6 B n B n 1 ,
for n 2 and the initial conditions B 0 = 1 and B 1 = 6 . They developed the Binet formula, generating function, and several identities by solving this recurrence relation as a second-order linear homogeneous difference equation. Since b is a balancing number if and only if the number 8 b 2 + 1 is a perfect square, then the definition of a related number is as given in [3], namely, the Lucas-balancing numbers.
We use { C n } n 0 to denote the sequence of Lucas-balancing numbers corresponding to the balancing numbers { B n } n 0 . The n-th Lucas-balancing number is defined by
C n = 8 ( B n ) 2 + 1 .
It is interesting to note that the sequence of Lucas-balancing numbers satisfies the same recurrence relation as that of balancing numbers, namely,
C n + 1 = 6 C n C n 1 ,
for n 2 and initial conditions C 0 = 1 and C 1 = 3 (see more in [2,3,4,5,6,7,8,9,10,11,12]).
Soykan, in [1], provided the relations
4 E n = B n + 1 B n 1 ,
K n = 2 C n + 1 ,
where E n and K n denote, respectively, the Edouard and Edouard–Lucas numbers of order n. Moreover, in [12] (Theorem 2.1), the binomial expression was established for B n and C n , which is given by
B n = j = 0 ( n 1 ) / 2 ( 1 ) j n ( j + 1 ) j 6 n ( 2 j + 1 ) ,
C n = 3 j = 0 n / 2 ( 1 ) j n n j n j j 6 n ( 2 j + 1 ) ,
where · denotes the floor function.
Therefore, since there is a connection between the Edouard, Edouard–Lucas, and balancing numbers, it is possible to derive a binomial expression for E n and K n . In addition, using these binomial expressions, we can establish the incomplete Edouard and incomplete Edouard–Lucas numbers, which is a goal of this article.
Incomplete numbers are a widely studied subject and consist of the numerical sequence defined by the truncated sums of the binomial expression of a given numerical sequence. This class of sequences of numbers has revealed many interesting results. For example, the class of incomplete Fibonacci and Lucas numbers and their generalization as bivariate sequences and polynomials were explored in [13,14,15,16,17,18,19,20,21]. The incomplete k-Pell, k-Pell–Lucas, and modified k-Pell numbers were introduced in [22]. In addition, the incomplete Jacobsthal and Jacobsthal–Lucas numbers were investigated in [23]. However, the most interesting study for this article is the study of incomplete balancing and Lucas-balancing numbers, which were introduced and studied in [12]. The incomplete balancing numbers B n ( k ) and the incomplete Lucas-balancing numbers C n ( k ) are defined by
B n ( k ) = j = 0 k ( 1 ) j n ( j + 1 ) j 6 n ( 2 j + 1 ) , 0 k n 1 2 ,
and
C n ( k ) = 3 j = 0 k ( 1 ) j n n j n j j 6 n ( 2 j + 1 ) , 0 k n 2 ,
for any natural number n .
Next, we will introduce some identities that will be useful in this paper. In [12], the following identities were verified:
B n n 1 2 1 = B n ± 3 n , if n is even , B n ± 1 , if n is odd ,
for n 3 ,
k = 0 n 1 2 B n ( k ) = ( 3 n C n B n ) / 12 , if n is even ( 3 n C n + 7 B n ) / 16 , if n is odd ,
B n + 2 ( k + 1 ) = 6 B n + 1 ( k + 1 ) B n ( k ) ,
for 0 k < n 2 2 .
In this paper, motivated by the connection between the balancing, Lucas–balancing, Edouard, and Edouard–Lucas numbers, we will introduce the incomplete Edouard and incomplete Edouard–Lucas numbers. We will provide some of the properties of these new sequences of numbers and establish identities and the generating function for each sequence.
This article is organized as follows: In Section 2, we will define the incomplete Edouard and incomplete Edouard–Lucas numbers and provide some of the properties of these sequences of numbers. Section 3 is devoted to establishing some identities involving these sequences of numbers. In Section 4, their generating functions are provided and, finally, conclusions are stated.

2. The Incomplete Edouard and Incomplete Edouard–Lucas Numbers

This section will introduce the incomplete Edouard and incomplete Edouard–Lucas numbers. In addition, some properties of these numbers will be established. First, we will establish the binomial expressions of the Edouard and Edouard–Lucas numbers. Consider the following lemma:
Lemma 1.
For all n > 0 and 0 j < n 2 , we know that
6 n j j n j 1 j = n j 1 j 5 n 4 j n 2 j .
According Equation (5), we obtain
B n + 1 B n = j = 0 n / 2 ( 1 ) j ( n + 1 ) ( j + 1 ) j 6 ( n + 1 ) ( 2 j + 1 ) j = 0 ( n 1 ) / 2 ( 1 ) j n ( j + 1 ) j 6 n ( 2 j + 1 ) = j = 0 n / 2 ( 1 ) j n j j 6 n 2 j + j = 0 ( n 1 ) / 2 ( 1 ) j + 1 n ( j + 1 ) j 6 n ( 2 j + 1 ) .
Then, by using Lemma 1 and considering odd n , we have
B n + 1 B n = j = 0 n / 2 ( 1 ) j n j 1 j 5 n 4 j n 2 j 6 n ( 2 j + 1 ) .
Otherwise, if n is even, we find that
B n + 1 B n = j = 0 ( n 1 ) / 2 ( 1 ) j n j 1 j 5 n 4 j n 2 j 6 n ( 2 j + 1 ) + ( 1 ) n / 2 .
Therefore, since Equation (3) holds, we provide the binomial expression for Edouard numbers as follows.
Proposition 1.
For all n > 0 , the following identity holds:
4 E n = j = 0 n / 2 ( 1 ) j n ( j + 1 ) j 5 n 4 j n 2 j 6 n ( 2 j + 1 ) 1 , f o r o d d n j = 0 ( n 1 ) / 2 ( 1 ) j n j 1 j 5 n 4 j n 2 j 6 n ( 2 j + 1 ) + ( 1 ) n / 2 1 , f o r e v e n n .
Similarly, using Equation (4), we obtain the binomial expression for Edouard–Lucas numbers, which is presented in the following proposition.
Proposition 2.
For all n > 0 , the following identity holds:
K n = 1 + j = 0 n / 2 ( 1 ) j n n j n j j 6 n 2 j .
Propositions 1 and 2 give us the binomial expressions for incomplete Edouard and incomplete Edouard–Lucas numbers. Moreover, the binomial expressions allow us to define the incomplete Edouard and incomplete Edouard–Lucas numbers, as demonstrated below.
Definition 1.
For any positive integer n, the incomplete Edouard numbers E n ( k ) are defined by
4 E n ( k ) = j = 0 k ( 1 ) j n ( j + 1 ) j 5 n 4 j n 2 j 6 n ( 2 j + 1 ) 1 ,
for 0 k < n 1 2 and E n ( n 1 2 ) = E n .
Definition 2.
For any positive integer n , the incomplete Edouard–Lucas numbers K n ( k ) are defined by
K n ( k ) = j = 0 k ( 1 ) j n n j n j j 6 n 2 j + 1 , 0 k n 2 .
Table 1 and Table 2 show us the values of 4 E n ( k ) and K n ( k ) for n = 1 , , 11 and k = 0 , , 5 . Next, we will provide some of the properties of these new sequences of numbers, some of which can be verified directly by looking at Table 1 and Table 2. The following proposition is derived directly from Definitions 1 and 2.
Proposition 3.
For all n 1 , we know that
E n n 1 2 = E n ,
K n n 2 = K n .
4 E n ( 0 ) = 5 · 6 n 1 1 ,
K n ( 0 ) = 6 n + 1 .
The result below gives us the value of K n ( n 2 1 ) for odd n and even n in terms of the n-th Edouard–Lucas number.
Proposition 4.
For all integers n 2 , the following identity holds:
K n ( n 2 1 ) = K n 2 ( 1 ) n 2 , f o r e v e n n , K n + ( 1 ) n 2 ( 12 n 2 + 6 ) , f o r o d d n .
Proof. 
Suppose n is even, i.e, n = 2 t . We know that n 2 = 2 t 2 = t . The term n 2 in Equation (13) is
( 1 ) t 2 t t t 2 t 2 t t 6 2 t 2 t = ( 1 ) t 1 · 2 · 1 = ( 1 ) t 2 .
Therefore, by using Equation (14), we obtain
K n n 2 1 = K n n 2 ( 1 ) t 2 t t t 2 t 2 t t 6 2 t 2 t = K n 2 ( 1 ) n 2 .
Otherwise, suppose n = 2 t + 1 . We know that n 2 = 2 t + 1 2 = t . In this case, the term n 2 in Equation (13) is
( 1 ) t 2 t + 1 t t 2 t + 1 2 t + 1 t 6 2 t + 1 2 t = ( 1 ) t t + 1 t · 2 t + 1 t + 1 · 6 1 = ( 1 ) t 6 ( t + 1 ) .
Thus,
K n n 2 1 = K n n 2 ( 1 ) t 2 t + 1 t t 2 t + 1 2 t + 1 t 6 2 t + 1 2 t = Equation ( 14 ) K n ( 1 ) t 6 ( t + 1 ) ,
which ends the proof. □

3. Some Identities

In this section, we will provide some identities that involve the incomplete Edouard and incomplete Edouard–Lucas numbers, and their related sequences of numbers, such as balancing, Lucas-balancing, incomplete balancing, and incomplete Lucas-balancing numbers.
The next proposition is derived from Definition 1 and Equation (3).
Proposition 5.
Let n and k be positive integers with 0 k < n 1 2 . Then,
4 E n ( k ) = B n + 1 ( k ) B n ( k ) 1 ,
In addition, for k = n 1 2 , we have
4 E n ( k ) = B n + 1 ( k ) B n ( k ) 1 , f o r o d d n B n + 1 ( k + 1 ) B n ( k ) 1 , f o r e v e n n .
From Equations (9) and (15), we obtain the following proposition directly.
Proposition 6.
For n 3 , the following identities hold:
4 E n n 1 2 1 = 4 E n ± 3 n ± 1 , i f n i s e v e n , 4 E n ± 3 ( n + 1 ) ± 1 , i f n i s o d d .
The next result gives us the incomplete Edouard numbers in terms of balancing and Lucas-balancing numbers.
Proposition 7.
For incomplete Edouard numbers E n ( k ) , the following identity holds:
4 k = 0 n 1 2 E n ( k ) = X , if n is even Y , if n is odd
where X = ( 3 ( n + 1 ) C ( n + 1 ) B ( n 1 ) ) / 12 ( 3 n C n + 7 B n ) / 16 ( n 1 2 + 1 ) 6 n and Y = ( 3 ( n + 1 ) C ( n + 1 ) B ( n 1 ) ) / 12 ( 3 n C n + 7 B n ) / 16 ( n 1 2 + 1 ) .
Proof. 
The proof follows by Equations (10) and (15). □
Recall Equation (11), namely,
B n + 2 ( k + 1 ) = 6 B n + 1 ( k + 1 ) B n ( k ) ,
for 0 k < n 2 2 . Then, it is possible to establish a recurrence relation to the incomplete Edouard numbers as follows.
Proposition 8.
Let n and k be positive integers with 0 k < n 1 2 . Then, the recurrence relation of the incomplete Edouard numbers E n ( k ) is given by
4 E n ( k ) = 24 E n 1 ( k ) 4 E n 2 ( k 1 ) + 4 ,
Proof. 
For 0 k n 2 2 , the proof follows by substituting Equation (11) into Equation (15). □
Now, from Definition 2 and Equation (4), we can find the relationship between the incomplete Lucas-balancing numbers and the incomplete Edouard–Lucas numbers.
Proposition 9.
Let n and k be positive integers with 0 k n 2 . Then,
K n ( k ) = 2 C n ( k ) + 1 .
Proposition 10.
Let n and k be positive integers with 1 k < n 2 . Then, the recurrence relation of the incomplete Edouard–Lucas numbers K n ( k ) is given by
K n + 2 ( k + 1 ) = 6 K n + 1 ( k + 1 ) K n ( k ) + 4 ,
Proof. 
Since, for 1 k < n 2 , 6 C n + 1 ( k + 1 ) C n ( k ) = C n + 2 ( k + 1 ) [12] (Proposition 3.10), holds by Proposition 9 we know that
6 K n + 1 ( k + 1 ) K n ( k ) = 6 ( 2 C n + 1 ( k + 1 ) + 1 ) ( 2 C n ( k ) + 1 ) = 2 ( 6 C n + 1 ( k + 1 ) C n ( k ) ) + 5 = 2 C n + 2 ( k + 1 ) + 5 = K n + 2 ( k + 1 ) + 4 .
Propositions 8 and 10 show us the recurrence relations of the incomplete Edouard and incomplete Edouard–Lucas numbers. Note that these sequences do not have the same recurrence relations as those which occur between the Edoaurd and Edouard–Lucas sequences of numbers.
The next result gives us the relation between the sum of incomplete Edouard–Lucas numbers and the balancing and Lucas Balancing numbers.
Proposition 11.
For incomplete Edouard–Lucas numbers,
k = 0 n 1 2 K n ( k ) = 2 C n + n ( 3 B n 2 C n ) + n 1 2 + 1 , if n is even , C n + n ( 3 B n 2 C n ) + n 1 2 + 1 , if n is odd .
In addition, since B n + 1 ( k ) B n 1 ( k 1 ) = 2 C n ( k ) for 0 k n 2 , then using Proposition 3.9 in [12], we obtain the following result.
Proposition 12.
For incomplete Edouard numbers and incomplete Edouard–Lucas numbers, it holds that
4 E n ( k ) K n ( k ) = B n ( k ) B n 1 ( k 1 ) 2 ,
for 0 k n ^ , where n ^ = n 2 and B n ( k ) is the n-th incomplete balancing number.

4. Generating Functions of Incomplete Edouard and Incomplete Edouard–Lucas Numbers

In this section, we provide generating functions for both incomplete Edouard and incomplete Edouard–Lucas numbers. First, we need to recall a result stated in [15], and then we will use it in the proof of the statement of each one of the generating functions. Consider the following result (see [15] (p. 592)):
Theorem 1
([15] (Lemma)). Let { s n } n 0 be a complex sequence satisfying the following non-homogeneous recurrence relation:
s n = a s n 1 + b s n 2 + r n ( n > 1 ) ,
where a and b are complex numbers and { r n } n 0 is a given complex sequence. Then, the generating function U ( t ) of the sequence { s n } is
U ( t ) = G ( t ) + s 0 r 0 + ( s 1 s 0 a r 1 ) t 1 a t b t 2 ,
where G ( t ) denotes the generating function of { r n } .
This theorem can be obtained by using the standard method. By applying Theorem 1, we obtain the next generating functions of incomplete Edouard and incomplete Edouard–Lucas numbers, as follows.
Proposition 13.
The generating function for the incomplete Edouard sequence { E n ( k ) } n 0 is
G F E ( k , t ) = G ( t ) + E 0 ( k ) 1 + ( E 1 ( k ) 6 E 0 ( k ) 1 ) t 1 6 t + t 2 ,
where G ( t ) = 1 + t + t 2 + .
Proof. 
By Proposition 8 we know that
E n ( k ) = 6 E n 1 ( k ) E n 2 ( k 1 ) + 1 ,
where a = 6 , b = 1 and { r n } = { 1 , 1 , } . So, the generating function of { r n } is G ( t ) = 1 + t + t 2 + , and thus we obtain the result. □
Proposition 14.
The generating function for the incomplete Edouard–Lucas sequence { K n ( k ) } n 0 is
G F K ( k , t ) = G ( t ) + K 0 ( k ) + 4 + ( K 1 ( k ) 6 K 0 ( k ) + 4 ) t 1 6 t + t 2 ,
where G ( t ) = 4 ( 1 + t + t 2 + ) .
Proof. 
By Proposition 10 we know that
K n ( k ) = 6 K n 1 ( k ) K n 2 ( k 1 ) 4 ,
where a = 6 , b = 1 and { r n } = { 4 , 4 , } . So, the generating function of { r n } is G ( t ) = 4 ( 1 + t + t 2 + ) , and thus we obtain the result. □

5. Conclusions

This study has introduced two new sequences of numbers: the incomplete Edouard and incomplete Edouard–Lucas numbers. We provided properties and recurrence relations for each sequence. Moreover, we established identities and relations between the incomplete Edouard and incomplete Edouard–Lucas numbers, and the balancing and Lucas-balancing numbers. Finally, we presented the generating functions of the incomplete Edouard and incomplete Edouard–Lucas numbers.
It seems to us that the results presented here are new and we believe that these sequences could be the subject of other future studies.

Author Contributions

E.V.P.S., E.A.C. and P.C. contributed equally to this work. All authors have read and agreed to the published version of the manuscript.

Funding

The second author was partially supported by PROPESQ-UFT. The last author is a member of the Research Centre CMAT-UTAD (Polo of Research Centre CMAT—Centre of Mathematics of University of Minho) and thanks Portuguese Funds presented through FCT–Fundação para a Ciência e a Tecnologia, within the Projects UIDB/00013/2020 and UIDP/00013/2020.

Data Availability Statement

Data are contained within the article.

Acknowledgments

The first author expresses their sincere thanks to the Brazilian National Council for Scientific and Technological Development-CNPq-Brazil and the Federal University of Mato Grosso do Sul–UFMS/MEC–Brazil for their valuable support. The second author was partially supported by PROPESQ-UFT. The last author is a member of the Research Centre CMAT-UTAD (Polo of Research Centre CMAT—Centre of Mathematics of University of Minho) and thanks Portuguese Funds presented through FCT–Fundação para a Ciência e a Tecnologia, within the Projects UIDB/00013/2020 and UIDP/00013/2020.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Soykan, Y. Generalized Edouard numbers. Int. J. Adv. Appl. Math. and Mech. 2022, 3, 41–52. [Google Scholar]
  2. Behera, A.; Panda, G.K. On the square roots of triangular numbers. Fibonacci Quart. 1999, 37, 98–105. [Google Scholar] [CrossRef]
  3. Ray, P.K. Balancing and Cobalancing Numbers. Ph.D. Thesis, Department of Mathematics, National Institute of Technology, Rourkela, India, 2009. [Google Scholar]
  4. Bouroubi, S. On the Square-triangular and Balancing-Numbers. Rostock Math. Kolloq. 2012, 72, 73–80. [Google Scholar]
  5. Chimpanzo, J.; Catarino, P.; Vasco, P.; Borges, A. Bidimensional extensions of balancing and Lucas-Balancing numbers. J. Discret. Math. Sci. Cryptogr. 2014, 27, 95–115. [Google Scholar] [CrossRef]
  6. Chimpanzo, J.; Catarino, P.M.M.C.; Espinar, M.V.O. Some Identities and Generating Functions for Bidimensional Balancing and Cobalancing Sequences. Univers. J. Math. Appl. 2024, 7, 68–75. [Google Scholar] [CrossRef]
  7. Frontczak, R.; Baden-Württemberg, L. Sums of balancing and Lucas-balancing numbers with binomial coefficients. Int. J. Anal. Appl. 2018, 12, 585–594. [Google Scholar] [CrossRef]
  8. Liptai, K. Lucas Balancing Numbers. Acta Math. Univ. Ostrav. 2006, 14, 43–47. [Google Scholar]
  9. Liptai, K.; Luca, F.; Pinter, A.; Szalay, L. Generalized Balancing Numbers. Indag. Math. 2009, 20, 87–100. [Google Scholar] [CrossRef]
  10. Olajos, P. Properties of Balancing, Cobalancing, and Generalized Balancing Numbers. Ann. Math. Inform. 2010, 37, 125–138. [Google Scholar]
  11. Panda, G.K.; Ray, P.K. Some Links of Balancing and Cobalancing Numbers with Pell and Associated Pell Numbers. Bull. Inst. Math. Acad. Sin. 2011, 6, 41–72. [Google Scholar]
  12. Patel, B.K.; Nurettin, I.; Ray, P.K. Incomplete balancing and Lucas-balancing numbers. Math. Rep. 2018, 20, 59–72. [Google Scholar]
  13. Djordjević, G.B. Generating functions of the incomplete generalized Fibonacci and generalized Lucas numbers. Fibonacci Quart. 2004, 42, 106–113. [Google Scholar] [CrossRef]
  14. Filipponi, P. Incomplete Fibonacci and Lucas numbers. Rend. Circ. Mat. Palermo 1996, 45, 37–56. [Google Scholar] [CrossRef]
  15. Pintér, A.; Srivastava, H.M. Generating functions of the incomplete Fibonacci and Lucas numbers. Rend. Circ. Mat. Palermo 1999, 48, 591–596. [Google Scholar] [CrossRef]
  16. Ramírez, J.L. Incomplete generalized Fibonacci and Lucas polynomials. Hacet. J. Math. Stat. 2015, 44, 363–373. [Google Scholar] [CrossRef]
  17. Tasci, D.; Firengiz, M.C.; Tuglu, N. Incomplete bivariate Fibonacci and Lucas p-polynomials. Discret. Dyn. Nat. Soc. 2012, 2012, 840345. [Google Scholar] [CrossRef]
  18. Tasci, D.; Firengiz, M.C. Incomplete Fibonacci and Lucas p-numbers. Math. Comput. Model. 2010, 52, 1763–1770. [Google Scholar] [CrossRef]
  19. Yilmaz, N. Incomplete Tribonacci Numbers and Its Determinants. Master’s Thesis, Selçuk University, Konya, Turkey, 2011. [Google Scholar]
  20. Yilmaz, N.; Taskara, N. Incomplete Tribonacci-Lucas Numbers and Polynomials. Adv. Appl. Clifford Algebr. 2015, 25, 741–753. [Google Scholar] [CrossRef]
  21. Zhong, J.; Yao, J.; Chung, C. A Note on Incomplete Fibonacci–Lucas Relations. Symmetry 2023, 15, 2113. [Google Scholar] [CrossRef]
  22. Catarino, P.; Campos, H. Incomplete k-Pell, k-Pell-Lucas, and modified k-Pell numbers. Hacet. J. Math. Stat. 2017, 46, 361–372. [Google Scholar] [CrossRef]
  23. Djordjevi’c, G.B.; Srivastava, H.M. Incomplete generalized Jacobsthal and Jacobsthal–Lucas numbers. Math. Comput. Model. 2005, 42, 1049–1056. [Google Scholar] [CrossRef]
Table 1. Incomplete Edouard numbers.
Table 1. Incomplete Edouard numbers.
n/k012345
14
228
3179168
41080984
5647957235740
638,87833,26233,460
7233,279193,103195,047195,024
81,399,6801,119,7441,137,0241,136,688
98,398,0796,485,1836,629,0396,625,0796,625,108
1050,388,47837,511,42238,654,49438,613,45438,613,964
11302,330,879216,670,463225,441,791225,051,695225,058,715225,058,680
Table 2. Incomplete Edouard–Lucas numbers.
Table 2. Incomplete Edouard–Lucas numbers.
n/k012345
17
23735
3217199
4129711531155
5777766976727
646,65738,88139,20539,203
7279,937225,505228,529228,487
81,679,6171,306,3691,332,2891,331,7131,331,715
910,077,6977,558,2737,768,2257,761,7457,761,799
1060,466,17743,670,01745,302,97745,238,17745,239,07745,239,075
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Spreafico, E.V.P.; Costa, E.A.; Catarino, P. On the Incomplete Edouard and Incomplete Edouard–Lucas Numbers. Mathematics 2024, 12, 3357. https://doi.org/10.3390/math12213357

AMA Style

Spreafico EVP, Costa EA, Catarino P. On the Incomplete Edouard and Incomplete Edouard–Lucas Numbers. Mathematics. 2024; 12(21):3357. https://doi.org/10.3390/math12213357

Chicago/Turabian Style

Spreafico, Elen Viviani Pereira, Eudes Antonio Costa, and Paula Catarino. 2024. "On the Incomplete Edouard and Incomplete Edouard–Lucas Numbers" Mathematics 12, no. 21: 3357. https://doi.org/10.3390/math12213357

APA Style

Spreafico, E. V. P., Costa, E. A., & Catarino, P. (2024). On the Incomplete Edouard and Incomplete Edouard–Lucas Numbers. Mathematics, 12(21), 3357. https://doi.org/10.3390/math12213357

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop