[3] Bednařík, D., Trojovská, E.:
Repdigits as product of Fibonacci and Tribonacci numbers. Mathematics 8 (2020), Article ID 1720, 8 pages.
DOI 10.3390/math8101720
[11] Coufal, P., Trojovský, P.:
Repdigits as product of terms of $k$-Bonacci sequences. Mathematics 9 (2021), Article ID 682, 10 pages.
DOI 10.3390/math9060682
[12] Weger, B. M. M. de:
Algorithms for Diophantine equations. CWI Tract, 65. Centrum voor Wiskunde en Informatica, Amsterdam (1989).
MR 1026936 |
Zbl 0687.10013
[13] Dresden, G. P. B., Du, Z.:
A simplified Binet formula for $k$-generalized Fibonacci numbers. J. Integer Seq. 17 (2014), Article 14.4.7, 9 pages.
MR 3181762 |
Zbl 1360.11031
[14] Dujella, A., Pethő, A.:
A generalization of a theorem of Baker and Davenport. Q. J. Math., Oxf. II. Ser. 49 (1998), 291-306.
MR 1645552 |
Zbl 0911.11018
[16] Luca, F.:
Fibonacci and Lucas numbers with only one distinct digit. Port. Math. 57 (2000), 243-254.
MR 1759818 |
Zbl 0958.11007
[17] Marques, D.:
On $k$-generalized Fibonacci numbers with only one distinct digit. Util. Math. 98 (2015), 23-31.
MR 3410879 |
Zbl 1369.11014
[19] Meguedmi, D., Rihane, S. E., Togbé, A.:
Generalization of a theorem of Adegbindin, Luca and Togbé. Rev. R. Acad. Cienc. Exactas Fís. Nat., Ser. A Mat., RACSAM 116 (2022), Article ID 36, 13 pages.
DOI 10.1007/s13398-021-01177-2 |
MR 4336279 |
Zbl 1480.11024