On repdigits as product of $k$-Fibonacci and $k$-Lucas numbers
For an integer $k\geq2$, let $(F_n^{(k)})_{n\geq-(k-2)}$, $(L_n^{(k)})_{n \geq-(k-2)}$ be $k$-Fibonacci and $k$-Lucas sequences, respectively. For these sequences the first $k$ terms are $0,\ldots,0,1$ and $0,\ldots,0,2,1$, respectively, and each term afterwards is the sum of the preceding $k$ terms...
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
Institute of Mathematics of the Czech Academy of Science
2026-04-01
|
| Serie: | Mathematica Bohemica |
| Soggetti: | |
| Accesso online: | https://mb.math.cas.cz/full/151/1/mb151_1_3.pdf |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|