Results 71 to 80 of about 133 (87)
Some of the next articles are maybe not open access.
On X-coordinates of Pell equations which are repdigits
Research in Number Theory, 2020Let \( b\ge 2 \) be an integer. A positive integer \( N \) is called a \textit{base \( b \) repdigit} provided it has one distinct digit its base \( b \)-representation. That is, \( N \) is of the form \begin{align*} N= a\left(\dfrac{b^m-1}{b-1}\right), \quad \text{with} \quad a\in \{1, 2, \ldots, b-1\}\quad \text{and} \quad m\ge 1. \end{align*} Let \(
Carlos A. Gómez +2 more
openaire +1 more source
k-Pell Numbers as Product of Two Repdigits
Mediterranean Journal of Mathematics, 2022The paper deals with the investigation of generalized Pell numbers of order \(k\), which are products of two repdigits. Since last two-three decades, there has been a lot of studies that involves the search of repdigits either in a particular sequence or the sums or products of sequential terms.
openaire +2 more sources
Repdigits as sums of two Padovan numbers
J. Integer Seq., 2019Let $ \{P_{n}\}_{n\geq 0} $ be the sequence of Padovan numbers given by $P_0=0, ~P_1= 1, ~P_2=1 \text{ and } P_{n+3}= P_{n+1}+P_n \text{ for all } n\geq 0$. This is the sequence $A000931$ on the Online Encyclopedia of Integer Sequences (OEIS). The first few terms of this sequence are \[\{P_{n}\}_{n\ge 0} = 0, 1, 1, 1, 2, 2, 3, 4, 5, 7, 9, 12, 16, 21 ...
Ana Cecilia García Lomelí +1 more
openaire +2 more sources
Repdigits as sums of two $$k$$ k -Fibonacci numbers
Monatshefte für Mathematik, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bravo, Jhon J., Luca, Florian
openaire +2 more sources
Lucas numbers as sums of two repdigits
Lithuanian Mathematical Journal, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Adegbindin, Chèfiath +2 more
openaire +1 more source
Relationships among Repdigit Sets Derived from Fibonacci and Lucas Products in Bases 2 to 10
Harunori Nakayama
exaly +2 more sources
Repdigits as sums of four Fibonacci or Lucas numbers
J. Integer Seq., 2018The Fibonacci sequence \((F_n)_{n\ge 0}\), is defined by the linear recurrence \(F_0=0\), \(F_1=1\), and \(F_{n+2}=F_{n+1}+ F_n\) for all \(n\ge 0\). The Lucas sequence \((L_n)_{n\ge 0}\), is defined by the same recurrence but with different initial terms, \(L_0=2\) and \(L_1=1\).
Benedict Vasco Normenyo +2 more
openaire +2 more sources
Repdigits As Sums Of Two Lucas Numbers
2021Bu yayının lisans anlaşması koşulları tam metin açık erişimine izin vermemektedir.
Siar, Zafer +2 more
openaire +1 more source
Almost Repdigit k-Fibonacci Numbers with an Application of k-Generalized Fibonacci Sequences
Mathematics, 2023Murat Alan, Alaa Altassan
exaly
Fibonacci numbers which are concatenations of two repdigits
Quaestiones Mathematicae, 2021Hatoon Shoaib +2 more
exaly