Results 21 to 30 of about 161 (91)
Curious Generalized Fibonacci Numbers [PDF]
Mathematics, 2021 A generalization of the well-known Fibonacci sequence is the k−Fibonacci sequence whose first k terms are 0,…,0,1 and each term afterwards is the sum of the preceding k terms. In this paper, we find all k-Fibonacci numbers that are curious numbers (i.e.,
Jose L. Herrera +2 more
doaj +2 more sources
On Sierpiński and Riesel Repdigits and Repintegers [PDF]
For positive integers $b\geq 2 ...
Bispels, Chris +6 more
core +5 more sources
A Diophantine equation in $k$-Fibonacci numbers and repdigits [PDF]
Colloquium Mathematicum, 2018 Summary: The \(k\)-generalized Fibonacci sequence \(\{F_{n}^{(k)}\}_{n}\) starts with the \(k\) values \(0,\dots ,0,1\) and each term afterwards is the sum of the \(k\) preceding terms. We study which members of this sequence are sums of two repdigts, extending a result of \textit{S. Díaz Alvarado} and \textit{F. Luca} [Aportaciones Mat., Investig. 20,
Bravo, J. +2 more
openaire +6 more sources
Padovan numbers that are concatenations of two distinct repdigits [PDF]
Mathematica Slovaca, 2020 Abstract Let ( P n ) n ≥0 be the sequence of Padovan numbers defined by P
Ddamulira, M.
openaire +7 more sources
Tribonacci numbers that are concatenations of two repdigits. [PDF]
Rev R Acad Cienc Exactas Fis Nat A Mat, 2020 Let $ (T_{n})_{n\ge 0} $ be the sequence of Tribonacci numbers defined by $ T_0=0 $, $ T_1=T_2=1$, and $ T_{n+3}= T_{n+2}+T_{n+1} +T_n$ for all $ n\ge 0 $. In this note, we use of lower bounds for linear forms in logarithms of algebraic numbers and the Baker-Davenport reduction procedure to find all Tribonacci numbers that are concatenations of two ...
Ddamulira M.
europepmc +6 more sources
Lucas numbers as sums of two repdigits [PDF]
Lithuanian Mathematical Journal, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Adegbindin, Chèfiath +2 more
openaire +3 more sources
Repdigits as sums of three Fibonacci numbers [PDF]
Mathematical Communications, 2012 In this paper, we find all base 10 repdigits which are sums of three Fibonacci numbers.
Luca, Florian, Florian Luca
openaire +3 more sources
Repdigits in generalized Pell sequences [PDF]
Archivum Mathematicum, 2020 In this paper, the authors study the \(k\)-generalized Pell sequence, which starts with \(0,\ldots,0,1\) and satisfies the recurrence \(P_n^{(k)}=2P_{n-1}^{(k)}+P_{n-2}^{(k)}+\cdots+P_{n-k}^{(k)}\). They find all \(k\)-generalized Pell numbers which are repdigits, namely \(P_5^{(3)}=33\) and \(P_6^{(4)}=88\).
Bravo, Jhon J., Herrera, Jose L.
openaire +2 more sources
Padovan numbers as difference of two repdigits [PDF]
, 2023 In this paper, we find all Padovan numbers which can be written as are difference of two repdigits. It is shown that all Padovan numbers which can be written as a difference of two repdigits are P-k is an element of {2, 3, 4, 5, 7, 9, 12, 16, 21, 28, 37,
core +1 more source
k-generalized Fibonacci numbers which are concatenations of two repdigits [PDF]
, 2021 We show that the k-generalized Fibonacci numbers that are concatenations of two repdigits have at most four ...
Alahmadi, Adel +7 more
core +2 more sources