Related papers: Repdigits as sums of three Padovan numbers

Let $ (P_{n})_{n\ge 0} $ be the sequence of Padovan numbers defined by $ P_0=0 $, $ P_1 =1=P_2$, and $ P_{n+3}= P_{n+1} +P_n$ for all $ n\ge 0 $. In this paper, we find all Padovan numbers that are concatenations of two distinct repdigits.

Padovan sequence is a ternary recurrent sequence defined by the recurrence relation $P_{n+3}=P_{n+1}+P_{n}$ with initial terms $P_{0}=P_{1}=P_{2}=1.$ In this study it is shown that $114,151,200,265,351,465,616,816,3329,4410,7739,922111$ are…

Let $ \{P_n\}_{n\geq 0} $ be the sequence of Perrin numbers defined by $P_0=3$, $P_1=0$,$P_2=2$ and $P_{n+3}=P_{n+1}+P_{n}$ for all $n \geq 0$. In this paper, we determine all Perrin numbers that are palindromic concatenations of two…

In this study, we find all Pell and Pell-Lucas numbers which are sums of three base 10 repdigits. The proof of our main theorem uses lower bounds for linear forms in logarithms of algebraic numbers and a version of the Baker-Davenport…

Let $ (P_n)_{n\ge 0}$ be the sequence of Perrin numbers defined by ternary relation $ P_0=3 $, $ P_1=0 $, $ P_2=2 $, and $ P_{n+3}=P_{n+1}+P_n $ for all $ n\ge 0 $. In this paper, we use Baker's theory for nonzero linear forms in logarithms…

A repdigit is a positive integer that has only one distinct digit in its decimal expansion, i.e., a number has the form $d(10^m-1)/9$ for some $m\geq 1$ and $1 \leq d \leq 9$. Let $\left(T_n\right)_{n\ge0}$ be the sequence of Tribonacci.…

In this paper, we investigate sums of three Fibonacci numbers that can be expressed as concatenations of three repdigits in base $b$, where $b\ge 2$ is an integer. We prove that for bases $2\le b\le 10$, only finitely many such sums exist,…

Let $\left\lbrace P_{k}\right\rbrace_{k\geq0}$ be the Padovan sequence defined by $P_{k}=P_{k-2}+P_{k-3}$ with initial values are $P_{0}=P_{1}=P_{2}=1$. Let $\left\lbrace R_{k}\right\rbrace_{k\geq0}$ be the Perrin sequence defined by…

The van der Laan-Padovan sequence $P_n ~ (n=0, 1, \ldots)$ is defined by $P_0=1, P_1=P_2=0$, and $P_{n+3}=P_{n+1}+P_n$ for $n=0, 1, \ldots$. We determine all pairs $(P_m, P_n)$ satisfying $P_m^b=2^{g_1} 3^{g_2} 5^{g_3} 7^{g_4} P_n^a$ for…

The aim of this article is to give some properties of the so-called Padovan sequence $(T_n)_{n \ge 0}$ defined by $$ T_{n+3}=T_{n+1}+T_n \forall n \in \mathbb{N}, T_1=T_2=T_3=1$$ that is divisibility properties, periods, identities.

Let $ \{P_{n}\}_{n\geq 0} $ be the sequence of Pell numbers defined by $ P_0=0 $, $ P_1 =1$ and $ P_{n+2}= 2P_{n+1} +P_n$ for all $ n\geq 0 $ and let $ \{Q_{n}\}_{n\geq 0} $ be its companion sequence, the Pell-Lucas numbers defined by $…

The purpose of this note is to report on the discovery of the primes of the form $p=1+n!\sum n$, for some natural numbers $n>0$. The number of digits in the prime p are approximately equal to $\lfloor log_{10}(1+n!\sum n)\rceil+1$.

Let $\beta$ be a non-unit real algebraic integer greater than one and $\{a_{n}\}_{n \geq 0}$ be a sequence satisfying a linear recurrence relation $a_{n+3}=aa_{n+2}+ba_{n+1}+ca_{n}$. Under certain conditions, we prove that the number of…

For any integer $k \geq 2$, let $\{Q_{n}^{(k)} \}_{n \geq -(k-2)}$ denote the $k$-generalized Pell-Lucas sequence which starts with $0, \dots ,2,2$($k$ terms) where each next term is the sum of the $k$ preceding terms. In this paper, we…

Let $ \{L_n\}_{n\geq 0} $ be the sequence of Lucas numbers. In this paper, we determine all Lucas numbers that are palindromic concatenations of two distinct repdigits.

Repdigits are natural numbers formed by the repetition of a single digit. In this paper, we explore the presence of repdigits in the product of consecutive balancing or Lucas-balancing numbers.

Recall that repdigit in base $g$ is a positive integer that has only one digit in its base $g$ expansion, i.e. a number of the form $a(g^m-1)/(g-1)$, for some positive integers $m\geq 1$, $g\geq 2$ and $1\leq a\leq g-1$. In the present…

Repdigits are natural numbers formed by the repetition of a single digit. In this paper, we study the problem of writing repdigits as the difference of two balancing or Lucas-balancing numbers. The method of proof involves the application…

The Tribonacci-Lucas sequence $\{S_n\}_{n\ge 0}$ is defined by the linear recurrence relation $S_{n+3} = S_{n+2} + S_{n+1} + S_n$, for $ n\ge 0 $, with the initial conditions $S_0 =S_2= 3$ and $S_1 = 1$. A palindromic number is a number…

Narayana's cows sequence satisfies the third-order linear recurrence relation $N_n=N_{n-1}+N_{n-3}$ for $n \geq 3$ with initial conditions $N_0=0$ and $N_1=N_2=1$. In this paper, we study $b$-repdigits which are sums of two Narayana…