Results 71 to 80 of about 161 (91)

Lucas numbers which are concatenations of three repdigits

Results in Mathematics, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Erduvan, Fatih, Keskin, Refik, Keskin, Refik   +2 more
openaire   +3 more sources

Odd Repdigits to Small Bases Are Not Perfect

Integers, 2012
Abstract.We demonstrate, by considering each base in the range 2 through 9 ...
Kevin A. Broughan, Qizhi Zhou
openaire   +3 more sources

Lucas numbers which are concatenations of two repdigits

Boletín de la Sociedad Matemática Mexicana, 2021
Let \(\{L_n\}_{n\ge 0}\) be the Lucas-companion of the Fibonacci sequence given by \(L_0=2,~L_1=1\) and \(L_{n+2}=L_{n+1}+L_n\) for all \(n\ge 0\). In the paper under review, the authors show that the only Lucas numbers \(L_n\) which are concatenations of two rep-digits; that is, their base \(10\)-representation is of the form \(a\cdots ab\cdots b ...
Erduvan, Fatih, Keskin, Refik, Keskin, Refik   +2 more
openaire   +3 more sources

Repdigit Keith numbers

Lithuanian Mathematical Journal, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bravo, Jhon J., Guzmán, Sergio, Luca, Florian   +2 more
openaire   +1 more source

Tribonacci numbers with two blocks of repdigits

Mathematica Slovaca, 2021
AbstractThe Tribonacci sequence is a generalization of the Fibonacci sequence which starts with 0,0,1 and each term afterwards is the sum of the three preceding terms. Here, we show that the only Tribonacci numbers that are concatenations of two repdigits are 13,24,44,81.
Bravo, Eric F., Bravo, Jhon J.
openaire   +2 more sources

On X-coordinates of Pell equations which are repdigits

Research in Number Theory, 2020
Let \( 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 \(
Faith Shadow Zottor, CARLOS Gomez, Florian Luca   +2 more
exaly   +2 more sources

Repdigits as sums of two Padovan numbers

J. Integer Seq., 2019
Let $ \{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í, Santos Hernández Hernández   +1 more
openaire   +2 more sources

Repdigits as sums of two $$k$$ k -Fibonacci numbers

Monatshefte für Mathematik, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bravo, Jhon J., Luca, Florian
openaire   +2 more sources

Repdigits as sums of four Fibonacci or Lucas numbers

J. Integer Seq., 2018
The 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, Florian Luca, Alain Togbé   +2 more
openaire   +2 more sources

Padovan and Perrin numbers as product of two repdigits

Boletin De La Sociedad Matematica Mexicana, 2022
Salah Eddine Rihane, Alain Togbé, Togbé Alain   +2 more
exaly