summary:For an integer $k\ge 2$, let $({n})_n$ be the $k-$generalized Pell sequence which starts with $0,\ldots ,0,1$ ($k$ terms) and each term afterwards is given by the linear recurrence ${n} = 2{n-1}+{n-2}+\cdots +{n-k}$. In this paper, we find all $k$-generalized Pell numbers with only one distinct digit (the so-called repdigits). Some interesting estimations involving generalized Pell numbers, that we believe are of independent interest, are also deduced. This paper continues a previous work that searched for repdigits in the usual Pell sequence $(P_n^{(2)})_n$
summary:Let $k\geq 2$ and define $F^{(k)}:=(F_n^{(k)})_{n\geq 0}$, the $k$-generalized Fibonacci seq...
WOS:000351784600021The current article focus on the generalized k-Pell (p, i)-numbers for k = 1, 2, ...
n=0 is given by the recurrence un = 2un−1 + un−2 with initial condition u0 = 0, u1 = 1 and its assoc...
summary:For an integer $k\ge 2$, let $({n})_n$ be the $k-$generalized Pell sequence which starts wit...
The Pell sequence $(P_n)_{n=0}^{\infty}$ is the second order linear recurrence defined by $P_n=2P_{n...
In this paper, we show that there are no Pell or Pell-Lucas numbers larger than 10 with only one di...
For an integer $k\geq 2$, let $\{F^{(k)}_{n}\}_{n\geqslant 2-k}$ be the $k$-generalized Fibonacci se...
For an integer $k \geq 2$, let $\{ P_{n}^{(k)} \}_{n}$ be the $k$-generalized Pell sequence which st...
Here we are proposing a generalized sum for Pell numbers. This sum contains four Pell numbers. By m...
We show that the k-generalized Fibonacci numbers that are concatenations of two repdigits have at mo...
WOS: 000465142300003In this paper, we first define generalizations of Pell and Pell-Lucas sequences ...
International audienceFor an integer $k\ge 2$, let $\{F^{(k)}_{n}\}_{n\ge 2-k}$ be the $ k$--general...
We study a generalization of Pell's equation, whose coefficients are certain algebraic integers. Let...
Let k 2 and let (P(k) n )n>2-k be the k-generalized Pell sequence defined byP(k) n = 2P(k) n-1 + P(k...
summary:Let $(G_{n})_{n \geq 1}$ be a binary linear recurrence sequence that is represented by the L...
summary:Let $k\geq 2$ and define $F^{(k)}:=(F_n^{(k)})_{n\geq 0}$, the $k$-generalized Fibonacci seq...
WOS:000351784600021The current article focus on the generalized k-Pell (p, i)-numbers for k = 1, 2, ...
n=0 is given by the recurrence un = 2un−1 + un−2 with initial condition u0 = 0, u1 = 1 and its assoc...
summary:For an integer $k\ge 2$, let $({n})_n$ be the $k-$generalized Pell sequence which starts wit...
The Pell sequence $(P_n)_{n=0}^{\infty}$ is the second order linear recurrence defined by $P_n=2P_{n...
In this paper, we show that there are no Pell or Pell-Lucas numbers larger than 10 with only one di...
For an integer $k\geq 2$, let $\{F^{(k)}_{n}\}_{n\geqslant 2-k}$ be the $k$-generalized Fibonacci se...
For an integer $k \geq 2$, let $\{ P_{n}^{(k)} \}_{n}$ be the $k$-generalized Pell sequence which st...
Here we are proposing a generalized sum for Pell numbers. This sum contains four Pell numbers. By m...
We show that the k-generalized Fibonacci numbers that are concatenations of two repdigits have at mo...
WOS: 000465142300003In this paper, we first define generalizations of Pell and Pell-Lucas sequences ...
International audienceFor an integer $k\ge 2$, let $\{F^{(k)}_{n}\}_{n\ge 2-k}$ be the $ k$--general...
We study a generalization of Pell's equation, whose coefficients are certain algebraic integers. Let...
Let k 2 and let (P(k) n )n>2-k be the k-generalized Pell sequence defined byP(k) n = 2P(k) n-1 + P(k...
summary:Let $(G_{n})_{n \geq 1}$ be a binary linear recurrence sequence that is represented by the L...
summary:Let $k\geq 2$ and define $F^{(k)}:=(F_n^{(k)})_{n\geq 0}$, the $k$-generalized Fibonacci seq...
WOS:000351784600021The current article focus on the generalized k-Pell (p, i)-numbers for k = 1, 2, ...
n=0 is given by the recurrence un = 2un−1 + un−2 with initial condition u0 = 0, u1 = 1 and its assoc...