Abstract
AbstractA repdigit is a positive integer that has only one distinct digit in its decimal expansion, i.e., a number of the form $$a(10^m-1)/9$$
a
(
10
m
-
1
)
/
9
, for some $$m\ge 1$$
m
≥
1
and $$1 \le a \le 9$$
1
≤
a
≤
9
. Let $$\left( P_n\right) _{n\ge 0}$$
P
n
n
≥
0
and $$\left( E_n\right) _{n\ge 0}$$
E
n
n
≥
0
be the sequence of Padovan and Perrin numbers, respectively. This paper deals with repdigits that can be written as the products of consecutive Padovan or/and Perrin numbers.
Publisher
Springer Science and Business Media LLC
Reference14 articles.
1. Bravo, E.F., Gómez, C.A., Luca, F.: Product of consecutive Tribonacci numbers with only one distinct digit, J. Integer Sequences 22, Article 19.6.3. (2019)
2. Bugeaud,Y., Mignotte, M., Siksek, S.: Classical and modular approaches to exponential Diophantine equations I. Fibonacci and Lucas perfect powers. Ann. Math. 163, 969–1018 (2006)
3. Ddamulira, M.: Repdigits as sums of three Padovan numbers, accepted to appear in Bol. Soc. Mat. Mex. 26(2), 247–261 (2020)
4. Irmak, N.: On factorials in Perrin and Padovan sequences. Turk. J. Math. 43, 2602–2609 (2019)
5. Irmak, N.; Togbé, A.: On repdigits as product of consecutive Lucas numbers. Notes Number Theory Discrete Math. 24, 95–102 (2018)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献