Repdigits in k-generalized Pell sequence
Number Theory
2020-09-29 v1
Abstract
Let and let be -generalized Pell sequence defined by \begin{equation*}P_{n}^{(k)}=2P_{n-1}^{(k)}+P_{n-2}^{(k)}+...+P_{n-k}^{(k)}\end{equation*} for with initial conditions \begin{equation*}P_{-(k-2)}^{(k)}=P_{-(k-3)}^{(k)}=\cdot \cdot \cdot =P_{-1}^{(k)}=P_{0}^{(k)}=0,P_{1}^{(k)}=1. \end{equation*} In this paper, we deal with the Diophantine equation \begin{equation*}P_{n}^{(k)}=d\left( \frac{10^{m}-1}{9}\right)\end{equation*} in positive integers with and . We will show that repdigits with at least two digits in the sequence are the numbers\ and
Cite
@article{arxiv.2009.13387,
title = {Repdigits in k-generalized Pell sequence},
author = {Zafer Şiar and Refik Keskin},
journal= {arXiv preprint arXiv:2009.13387},
year = {2020}
}