<html><head><meta name="color-scheme" content="light dark"></head><body><pre style="word-wrap: break-word; white-space: pre-wrap;">\documentclass[12pt,reqno]{article}

\usepackage[usenames]{color}
\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsthm}
\usepackage{amsfonts}
\usepackage{amscd}
\usepackage{graphicx}

\usepackage[colorlinks=true,
linkcolor=webgreen,
filecolor=webbrown,
citecolor=webgreen]{hyperref}

\definecolor{webgreen}{rgb}{0,.5,0}
\definecolor{webbrown}{rgb}{.6,0,0}

\usepackage{color}
\usepackage{fullpage}
\usepackage{float}

\usepackage{psfig}
\usepackage{graphics}
\usepackage{latexsym}
\usepackage{epsf}
\usepackage{breakurl}

\setlength{\textwidth}{6.5in}
\setlength{\oddsidemargin}{.1in}
\setlength{\evensidemargin}{.1in}
\setlength{\topmargin}{-.1in}
\setlength{\textheight}{8.4in}

\newcommand{\seqnum}[1]{\href{https://oeis.org/#1}{\rm \underline{#1}}}

\newcommand{\R}{{\mathbb R}}
\newcommand{\Q}{{\mathbb Q}}
\newcommand{\C}{{\mathbb C}}
\newcommand{\N}{{\mathbb N}}
\newcommand{\Z}{{\mathbb Z}}

\newcommand{\Phibar}{\overline{\Phi}}
\let\up=\textsuperscript
\newcommand{\card}[1]{\mathrm{Card}\,#1}
\newcommand{\sg}{\mathrm{sg}}
\newcommand{\jsp}[1]{\textcolor{red}{#1}}
\newcommand{\abs}[1]{\left\vert#1\right\vert}

\begin{document}

\begin{center}
\epsfxsize=4in
\leavevmode\epsffile{logo129.eps}
\end{center}

\theoremstyle{plain}
\newtheorem{theorem}{Theorem}
\newtheorem{corollary}[theorem]{Corollary}
\newtheorem{lemma}[theorem]{Lemma}
\newtheorem{proposition}[theorem]{Proposition}

\theoremstyle{definition}
\newtheorem{definition}[theorem]{Definition}
\newtheorem{example}[theorem]{Example}
\newtheorem{conjecture}[theorem]{Conjecture}

\theoremstyle{remark}
\newtheorem{remark}[theorem]{Remark}


\begin{center}
\vskip 1cm{\LARGE\bf 
Fermat Padovan And Perrin Numbers}
\vskip 1cm
\large
Salah Eddine Rihane\\
Department of Mathematics\\
Institute of Science and Technology\\
University Center of Mila\\
Algeria\\
\href{mailto:salahrihane@hotmail.fr}{\tt salahrihane@hotmail.fr}\\
\ \\
Ch\`efiath Awero Adegbindin\\
Institut de Math\'ematiques et de Sciences Physiques\\
Dangbo\\
B\'enin\\
\href{mailto:adegbindinchefiath@gmail.com}{\tt adegbindinchefiath@gmail.com}\\
\ \\
Alain Togb\'e\\
Department of Mathematics, Statistics, and Computer Science\\
Purdue University Northwest\\
1401 S., U.S. 421  \\
Westville, IN 46391\\
USA\\
\href{mailto:atogbe@pnw.edu}{\tt atogbe@pnw.edu}\\
\end{center}

\vskip .2 in

\begin{abstract}
In this paper, we determine all the Padovan and Perrin numbers that are also
Fermat numbers.
\end{abstract}

\section{Introduction}\label{sec1}

The Padovan sequence $\{P_m\}_{m\geq 0}$ is  defined by 
\begin{equation}\label{eq: Pellrecur} 
P_{m+3} = P_{m+1} + P_m,
\end{equation}
for $m\geq 0$, where $P_0 =P_1 = P_2= 1$. This is the sequence \seqnum{A000931} in the {\it On-Line Encyclopedia of Integer Sequences} (OEIS).
A few terms of this sequence are
$$
1, 1, 1, 2, 2, 3, 4, 5, 7, 9, 12, 16, 21, 28, 37, 49, 65, 86, 114, 151, 200, \cdots
$$

Let $\{E_m\}_{m\geq 0}$  be the Perrin sequence given by
\begin{equation}
E_{m+3} = E_{m+1} + E_m,
\end{equation}
for $m\geq 0$, where $E_0 = 3$, $E_1=0$, and $E_2 = 2$. Its first few terms are
$$
3, 0, 2, 3, 2, 5, 5, 7, 10, 12, 17, 22, 29, 39, 51, 68, 90, 119, 158, 209, 277, 367, 486, 644, 853, \cdots
$$
It is the sequence  \seqnum{A001608} in the OEIS.

Let us also recall that a Fermat number is a number of the form
$$
{\mathcal F_m}=2^{2^m}+1,
$$
where $m$ is a nonnegative integer. The first elements of its list are 
$$
3, 5, 17, 257, 65537, 4294967297, 18446744073709551617,$$
$$ 340282366920938463463374607431768211457, $$
$$115792089237316195423570985008687907853269984665640564039457584007913129639937,...
$$
This is the sequence  \seqnum{A019434} in the OEIS.

In a recent paper, Bravo and Herrera \cite{Bravo-Herrera} found all $k$-Fibonacci and $k$-Lucas numbers that are also Fermat numbers. So the aim of this paper is to find all the Padovan and Perrin numbers that are also Fermat numbers.  The proofs of the results that we obtained are mainly based on linear forms in logarithms of algebraic numbers and a reduction algorithm originally introduced by Baker and Davenport in \cite{Baker-Davenport:1969}. Here, we use a version due to de Weger \cite{de Weger:1989}. So in Section \ref{sec2}, we will recall some results based on Baker's method, the Baker-Davenport  reduction method (de Weger's version), and some properties of Padovand and Perrin numbers. They are very useful for the proofs of our main results. In the last section, we will determine all Padovan and Perrin numbers that are Fermat numbers and show that these numbers are the only.


\section{The tools}\label{sec2}


\subsection{Linear forms in logarithms}\label{subsec:2.1}

We need some results from the theory of lower bounds for nonzero linear forms in logarithms of algebraic numbers. 
We start by recalling \cite[Theorem 9.4]{BMS}, which is a modified version of a result of Matveev \cite{matveev}. 
Let $\mathbb{L}$ be an algebraic number field of degree $d_{\mathbb{L}}$. Let $\eta_1, \eta_2, \ldots, \eta_l \in \mathbb{L}$  not $0$ or $1$ 
and $d_1, \ldots, d_l$ be nonzero integers. We put
$$
D =\max\{|d_1|, \ldots, |d_l|\},
$$
and
$$
\Gamma = \prod_{i=1}^l \eta_i^{d_i} -1.
$$
Let $A_1, \ldots, A_l$ be positive integers such that 
$$
A_j \geq h'(\eta_j) := \max \{d_{\mathbb{L}}h(\eta_j), |\log \eta_j|, 0.16\}, \quad {\text{\rm for}}\quad j=1,\ldots l,
$$
where for an algebraic number $\eta$  of minimal polynomial
$$
f(X)=a_0(X-\eta^{(1)})\cdots(X-\eta^{(k)})\in {\mathbb Z}[X]
$$
over the integers with positive $a_0$. We write $h(\eta)$ for its Weil height given by
$$
h(\eta)=\frac{1}{k}\left(\log a_0+\sum_{j=1}^k \max\{0,\log |\eta^{(j)}|\}\right).
$$
The following consequence of Matveev's theorem is \cite[Theorem 9.4]{BMS}.
\begin{theorem}\label{thm:Matveev}
 If $\Gamma \neq 0$ and $\mathbb{L} \subseteq \R $, then
\begin{equation*}
\label{ineq:matveev} \log |\Gamma| &gt; -1.4 \cdot
30^{l+3}l^{4.5}d_{\mathbb{L}}^2(1+ \log d_{\mathbb{L}})(1+ \log D)A_1A_2\cdots A_l.
\end{equation*}
\end{theorem}

\subsection{The Baker-Davenport reduction method}\label{subsec:2.2}

Here, we present a variant of the reduction method of Baker and Davenport due to de Weger  \cite{de Weger:1989}.



Let $\vartheta_1,\vartheta_2,\beta\in \mathbb{R}$ be given and let $x_1,x_2\in \mathbb{Z}$ be unknowns. Let
\begin{equation}\label{eq4}
\Lambda =\beta +x_1\vartheta_1 +x_2\vartheta_2.
\end{equation}
 Let $c$,  $\delta$ be positive constants. Set $X=\max\{|x_1|,|x_2|\}$. Let $X_0, Y$ be positive. Assume that 
 \begin{equation}\label{eq5}
 |\Lambda|&lt;c\cdot \exp(-\delta\cdot Y),
 \end{equation}
 \begin{equation}\label{eq6}
 X\leq X_0. 
 \end{equation}
When $\beta =0$ in \eqref{eq4}, we get 
$$\Lambda =x_1\vartheta_1 +x_2\vartheta_2.$$
Put $\vartheta=-{\vartheta_1}/{\vartheta_2}$. We assume that $x_1$ and $x_2$ are coprime. 
Let the continued fraction expansion of $\vartheta$ be given by 
$$[a_0,a_1,a_2,\ldots],$$ 
and let the $k$th convergent of $\vartheta$ be ${p_k}/{q_k}$ for $k=0,1,2,\ldots$.  We may assume without loss of generality that $|\vartheta_1|&lt;|\vartheta_2|$ and that $x_1&gt;0$. We have the following results.

\begin{lemma}  \label{lem4} (See \cite[Lemma 3.2]{de Weger:1989})
Let 
$$
A=\max_{0\le k\le Y_0} a_{k+1},
$$
where 
$$
Y_0=-1+\dfrac{\log(\sqrt{5}X_0+1)}{\log\left(\frac{1+\sqrt{5}}{2}\right)}.
$$ 
If \eqref{eq5} and \eqref{eq6} hold for $x_1$, $x_2$ and $\beta=0$, then 
\begin{equation}\label{eq10}
Y&lt;\frac{1}{\delta}\log \left(\frac{c(A+2)X_0}{|\vartheta_2|}\right).
\end{equation}
\end{lemma} 

When $\beta\neq 0$ in \eqref{eq4}, put $\vartheta=-{\vartheta_1}/{\vartheta_2}$ and $\psi={\beta}/{\vartheta_2}$. Then we have 
$$\frac{\Lambda}{\vartheta_2}=\psi-x_1\vartheta+x_2.$$ Let ${p}/{q}$ be a convergent of $\vartheta$ with $q&gt;X_0$. For a real number $x$, we let $\| x\|=\min\{|x-n|, n\in {\mathbb Z}\}$ be the distance from $x$
to the nearest integer. We have the following result.
\begin{lemma}  \label{lem5} (See \cite[Lemma 3.3]{de Weger:1989})
Suppose that 
$$\parallel q \psi\parallel&gt;\frac{ 2X_0}{q}.$$ 
Then, the solutions of \eqref{eq5} and \eqref{eq6} satisfy 
$$
Y&lt;\frac{1}{\delta}\log\left(\frac{q^2c}{|\vartheta_2|X_0} \right).$$
\end{lemma}

\subsection{Properties of Padovan and Perrin sequences}\label{subsec2.3}

In this subsection we recall some facts and properties of the Padovan and the Perrin sequences that will be used later. For more details about 
the Padovan and Perrin sequences, see \cite{de Weger:1997}.

The characteristic equation 
$$
x^3-x-1=0
$$
has roots $\alpha, \beta, \gamma=\overline{\beta}$, where
$$
\alpha=\dfrac{r_1+r_2}{6},\quad \beta=\dfrac{-r_1-r_2+i\sqrt{3}(r_1-r_2)}{12}
$$
and
$$
r_1=\sqrt[3]{108+12\sqrt{69}}\;\text{ and }\; r_2=\sqrt[3]{108-12\sqrt{69}}.
$$
Let 
\begin{align}\label{eq:Formula_a_b_c}
c_{\alpha} &amp;= \dfrac{(1-\beta)(1-\gamma)}{(\alpha-\beta)(\alpha-\gamma)}= \dfrac{1+\alpha}{-\alpha^2+3\alpha+1},\vspace{1mm}\nonumber \\
c_{\beta} &amp;= \dfrac{(1-\alpha)(1-\gamma)}{(\beta-\alpha)(\beta-\gamma)}=\dfrac{1+\beta}{-\beta^2+3\beta+1},\vspace{1mm}\\
c_{\gamma} &amp;= \dfrac{(1-\alpha)(1-\beta)}{(\gamma-\alpha)(\gamma-\beta)}=\dfrac{1+\gamma}{-\gamma^2+3\gamma+1}=\overline{c_{\beta}}.\nonumber
\end{align}
Binet's formula for $P_n$ is
\begin{equation}\label{eq:Binet_Padovan}
P_n=c_{\alpha}\alpha^n+c_{\beta}\beta^n+c_{\gamma}\gamma^n,\; \text{ for all } n\geq 0,
\end{equation}
and Binet's formula for $E_n$ is
\begin{equation}\label{eq:Binet_Perrin}
E_n=\alpha^n+\beta^n+\gamma^n,\; \text{ for all } n\geq 0.
\end{equation}
Numerically, we have
\begin{gather}\label{eq:Numericle_alpha_beta_a_b}
1.32&lt;\alpha&lt;1.33,\nonumber \\
0.86&lt;|\beta|=|\gamma|&lt;0.87,\nonumber \\
0.72&lt;c_{\alpha}&lt;0.73,\\
0.24&lt;|c_{\beta}|=|c_{\gamma}|&lt;0.25.\nonumber
\end{gather}
It is easy to check that
$$
|\beta|=|\gamma|=\alpha^{-1/2}.
$$
Further, using induction, one can prove that
\begin{equation}\label{eq:estimate_Padovan}
\alpha^{n-2}\leq P_n \leq \alpha^{n-1},\quad \text{holds for all } n\geq 4
\end{equation}
and 
\begin{equation}\label{eq:estimate_Perrin}
\alpha^{n-2}\leq E_n \leq \alpha^{n+1},\quad \text{holds for all } n\geq 2,
\end{equation}
see \cite{Lomeli-Hernandez:2019}.

\section{Proofs of the main results}\label{sec3}

In this section, we set and prove the two main results of our paper.

\subsection{Our first main result}\label{subsec3.1}

We will prove our first main result in this subsection. 
\begin{theorem}
The only Fermat numbers in the Padovan sequence are $P_5=3$ and $P_7=5$.
\end{theorem}
\begin{proof}
Let us consider the Diophantine equation
\begin{equation}\label{eq:1}
P_n=2^m+1.
\end{equation}
A quick computation with Maple reveals that the solutions of the Diophantine equation \eqref{eq:1} in the interval $[0,150]$ are $P_3,$ $P_4$, $P_5$, $P_7$, $P_{9}$, and $P_{16}$. It is easy to see that the only Fermat numbers are $P_5$ and $P_7$. 

From now, we assume that $n&gt;150$. Then by \eqref{eq:estimate_Padovan}, we have
$$
\alpha^{n-2}&lt;P_n=2^m+1&lt;2^{m+1}
$$
and
$$
2^m&lt;2^m+1=P_n&lt;\alpha^{n-1}.
$$ 
Thus we get
$$
(n-2)c_1-1&lt;m&lt;(n-1)c_1, \quad\text{where } c_1:=\log\alpha/\log2.
$$
In particular, we have $m&lt;n/2$. So to solve equation \eqref{eq:1}, it suffices to get a good upper bound for $n$. 

By \eqref{eq:Binet_Padovan}, equation \eqref{eq:1} can be expressed as
$$
2^m-c_{\alpha}\alpha^n=c_{\beta}\beta^n+c_{\gamma}\gamma^n-1,
$$
which we rewrite as
$$
\abs{2^m-c_{\alpha}\alpha^n}=\abs{c_{\beta}\beta^n+c_{\gamma}\gamma^n-1} &lt;\dfrac{3}{2}.
$$
Multiplying through by $c_{\alpha}^{-1}\alpha^{-n}$, we obtain
\begin{equation}\label{eq:upper-Gamma}
\abs{2^mc_{\alpha}^{-1}\alpha^{-n}-1}&lt;2.1 \alpha^{-n}.
\end{equation}
Now, we apply Matveev's theorem by taking 
$$
\Gamma:=2^mc_{\alpha}^{-1}\alpha^{-n}-1
$$
and
$$
\eta_1:=2,\quad \eta_2:=c_{\alpha},\quad \eta_3:=\alpha,\quad b_1:=m,\quad b_2:=-1,\quad b_3:=-n.
$$
The algebraic numbers $\eta_1$, $\eta_2$ and $\eta_3$ belong to $\mathbb{L}=\Q (\alpha)$ for which $d_{\mathbb{L}}=3$. Since $m&lt;n/2$, therefore we can take $D:=n=\max\{1,m,n\}$. Furthermore, we have
$$
h(\eta_1)=\log 2 \quad \text{and} \quad h(\eta_3)=\dfrac{\log \alpha}{3}.
$$
In this case we choose
$$
\max\{3h(\eta_1),\abs{\log\eta_1},0.16\}&lt;2.1:=A_1
$$
and
$$
\max\{3h(\eta_3),\abs{\log\eta_3},0.16\}=\log\alpha:=A_3.
$$
On the other hand, the minimal polynomial of $c_{\alpha}$ is 
$$
23x^3-23x^2+6x-1
$$
and has roots $c_{\alpha}$, $c_{\beta}$ and $c_{\gamma}$. Since $\abs{c_{\alpha}}&lt;1$ and $\abs{c_{\beta}}=\abs{c_{\gamma}}&lt;1$, then we get 
$$
h(\eta_2)=\dfrac{\log23}{3}.
$$
So we can take
$$
\max\{3h(\eta_2),\abs{\log\eta_2},0.16\}&lt;3.2:=A_3.
$$
To apply Matveev's theorem we will prove that $\Gamma\neq 0$. Suppose the contrary i.e $\Gamma=0$, so we get 
$$
2^m=c_{\alpha}\alpha^n.
$$
Conjugating the above relation using the $\Q$-automorphism of Galois $\sigma$ defined by $\sigma=(\alpha\beta)$ and taking the absolute value we obtain
$$
1&lt;2^m=\abs{c_{\beta}}\abs{\beta}^n&lt;1,
$$
which is a contradiction. Thus one can see that $\Gamma\neq 0$.

Using Matveev's theorem, we get  
\begin{align*}
\log\abs{\Gamma} &amp;&gt; -1.4\cdot 30^6 \cdot 3^{4.5} \cdot 3^2 (1+\log 3) (1+\log n) \cdot 2.1 \cdot \log \alpha \cdot 3.2\\
 &amp;&gt; -1.82 \cdot 10^{13} \cdot \log\alpha \cdot (2\log n)=3.64 \cdot 10^{13} \cdot \log\alpha \cdot \log n.
\end{align*}
The last inequality together with \eqref{eq:upper-Gamma} leads to
$$
n&lt;3.65\cdot 10^{13} \log n.
$$
Thus we obtain
\begin{equation}\label{eq:bound-n}
n&lt;1.3 \cdot 10^{15}.
\end{equation}
Now, we will use Lemma \ref{lem5} to reduce the upper bound \eqref{eq:bound-n} of $n$.

Define
$$
\Lambda:=m\log 2-n \log\alpha+\log(1/c_{\alpha}).
$$
Clearly, we have $e^{\Lambda}-1=\Gamma$. Since $\Gamma\neq 0$, then $\Lambda\neq 0$. If $\Lambda&gt;0$, then we get
$$
0&lt;\Lambda&lt;e^{\Lambda}-1=\abs{e^{\Lambda}-1}=\abs{\Gamma}&lt;2.1 \alpha^{-n}.
$$
If $\Lambda&lt;0$, then we have $1-e^{\Lambda}=\abs{e^{\Lambda}-1}=\abs{\Gamma}&lt;1/2$, because $n&gt;150$. This implies that $e^{\abs{\Lambda}}&lt;2$. Thus we have
$$
0&lt;\abs{\Lambda}&lt;e^{\abs{\Lambda}}-1=  e^{\abs{\Lambda}} \abs{\Gamma} &lt;4.2\alpha^{-n}.
$$
From both cases, we deduce that
$$
0&lt;\abs{n(-\log\alpha)+m\log 2+\log(1/c_{\alpha})}&lt; 4.2 \exp(-n\log\alpha).
$$
The inequality \eqref{eq:bound-n} implies that we take $X_0:=1.3\cdot 10^{13}$. Further, we choose
$$
c:=4.2,\quad \delta:= \log\alpha, \quad \psi:=\dfrac{\log(1/c_{\alpha})}{\log 2}
$$
$$
\vartheta:= \dfrac{\log\alpha}{\log2},\quad \vartheta_1:=-\log\alpha, \quad \vartheta_2:=\log 2,\quad \beta:=\log(1/c_{\alpha}).
$$
Using Maple, we see that 
$$
q_{41}=2263631680285337
$$
satisfies the hypotheses of Lemma \ref{lem5}. Furthermore, Lemma \ref{lem5} implies that
\begin{equation}
n&lt;\dfrac{1}{\log\alpha} \log \left(\dfrac{2263631680285337^2 \cdot 4.2}{\log 2 \cdot 1.3\cdot 10^{13}}\right)\leq 150.
\end{equation}
This contradicts the assumption that $n &gt; 150$. Therefore, the theorem is proved.
\end{proof}

\subsection{Our second main result}\label{subsec3.2}

In this subsection we will prove the following result.
\begin{theorem}
The only Fermat numbers in the Perrin sequence are $E_0=E_3=3$,  $E_5=E_6=5$, and $E_{10}=17$.
\end{theorem}
\begin{proof}
Let us consider the Diophantine equation
\begin{equation}\label{eq:2}
E_n=2^m+1.
\end{equation}
A quick computation in Maple reveals that the solutions of Diophantine equation \eqref{eq:1} in the interval $[0,150]$ are $E_0,$ $E_2$, $E_3$, $E_4$, $E_5$, $E_6$ and $E_{10}$. It is easy to see that the only Fermat numbers are $E_0$, $E_3$, $E_5$, $E_6$ and $E_{10}$. 

From now, we assume that $n&gt;150$, then by \eqref{eq:estimate_Perrin} we have
$$
\alpha^{n-2}&lt;E_n=2^m+1&lt;2^{m+1}
$$
and
$$
2^m&lt;2^m+1=E_n&lt;\alpha^{n+1}.
$$ 
Then, we get
$$
(n-2)c_1-1&lt;m&lt;(n+1)c_1, \quad\text{where } c_1:=\log\alpha/\log2.
$$
In particularly we have $m&lt;n/2$. To solve equation \eqref{eq:2}, it suffices to get a good upper bound for $n$. 

By \eqref{eq:Binet_Perrin}, equation \eqref{eq:2} can be rewritten into the form
$$
2^m-\alpha^n=\beta^n+\gamma^n-1.
$$
So we deduce that
$$
\abs{2^m-\alpha^n}=\abs{\beta^n+\gamma^n-1} &lt;2.8.
$$
Dividing both sides by $\alpha^{-n}$, we get
\begin{equation}\label{eq:upper-Gamma-2}
\abs{2^m\alpha^{-n}-1}&lt;2.8 \alpha^{-n}.
\end{equation}
Now, we apply Matveev's theorem by taking 
$$
\Gamma':=2^m\alpha^{-n}-1
$$
and
$$
\eta_1:=2,\quad \eta_2:=\alpha,\quad b_1:=m,\quad b_2:=-n.
$$
The algebraic numbers $\eta_1$ and $\eta_2$ belong to $\mathbb{L}:=\Q(\alpha)$ for which $d_{\mathbb{L}}=3$. Since $m&lt;n/2$, therefore we take $D:=n=\max\{1,m,n\}$. As seen before, we choose
$$
A_1:=2.1 \quad \text{and} \quad A_2:=\log \alpha.
$$
We can prove that $\Gamma'\neq 0$ using the same method as above to show that $\Gamma\neq 0$.

Matveev's theorem gives 
\begin{align*}
\log\abs{\Gamma'} &amp;&gt; -1.4\cdot 30^5 \cdot 2^{4.5} \cdot 3^2 (1+\log 3) (1+\log n) \cdot 2.1 \cdot \log \alpha  \\
 &amp;&gt; -3.06 \cdot 10^{10} \cdot \log\alpha \cdot (2\log n)=-6.12 \cdot 10^{10} \cdot \log\alpha \cdot \log n.
\end{align*}
Comparing the last inequality with \eqref{eq:upper-Gamma-2} yields
$$
n&lt;6.13\cdot 10^{10} \log n.
$$
Consequently, we obtain
\begin{equation}\label{eq:bound-n-2}
n&lt;1.8 \cdot 10^{12}.
\end{equation}
Now, to reduce the upper bound \eqref{eq:bound-n-2} of $n$, we will use Lemma \ref{lem4}.

Consider
$$
\Lambda':=m\log 2-n \log\alpha.
$$
Clearly, we have $e^{\Lambda'}-1=\Gamma'$. Since $\Gamma'\neq 0$, then $\Lambda'\neq 0$. If $\Lambda'&gt;0$, then we get
$$
0&lt;\Lambda'&lt;e^{\Lambda'}-1=\abs{e^{\Lambda'}-1}=\abs{\Gamma'}&lt;2.8 \alpha^{-n}.
$$
If $\Lambda'&lt;0$, then we have $1-e^{\Lambda'}=\abs{e^{\Lambda'}-1}=\abs{\Gamma'}&lt;1/2$, because $n&gt;150$. Thus $e^{\abs{\Lambda'}}&lt;2$. Therefore, we obtain
$$
0&lt;\abs{\Lambda'}&lt;e^{\abs{\Lambda'}}-1=  e^{\abs{\Lambda'}} \abs{\Gamma'} &lt;5.6\alpha^{-n}.
$$
In both cases we have
$$
0&lt;\abs{n(-\log\alpha)+m\log 2}&lt; 5.6 \exp(-\log\alpha \cdot n).
$$
The inequality \eqref{eq:bound-n} implies that we can take $X_0:=1.8\cdot 10^{12}$, thus we get $Y_0=59.3134\ldots$. Further, we choose
$$
c:=5.6,\quad \delta:= \log\alpha, \quad \vartheta:= \dfrac{\log\alpha}{\log2},\quad \vartheta_1:=-\log\alpha, \quad \vartheta_2:=\log 2.
$$
We use Maple to find that 
$$
A:=\max_{0\leq k\leq 59} a_{k+1}=80.
$$
So Lemma \ref{lem4} tells us 
\begin{equation}
n&lt;\dfrac{1}{\log\alpha} \log \left(\dfrac{5.6 \cdot (80+2) \cdot 1.8\cdot 10^{12}}{\log 2 }\right)\leq 126.
\end{equation}
This contradicts the assumption that $n &gt; 150$. Therefore, the theorem is proved.
\end{proof}

\begin{thebibliography}{9}

\bibitem{Baker-Davenport:1969}
A. Baker and H. Davenport, The equations $3x^2 - 2 = y^2$ and $8x^2 - 7 = z^2$, {\it Quart. J. Math. Oxford Ser. (2)} \textbf{20} (1969), 129--137.

\bibitem{Bravo-Herrera} J. J. Bravo and J. L. Herrera, Fermat
$k$-Fibonacci and $k$-Lucas numbers, {\it Math. Bohem.}
\textbf{145} (2020), 19--32.

\bibitem{BMS} Y. Bugeaud, M. Maurice, and S. Siksek,  Classical and
modular approaches to exponential Diophantine equations I. Fibonacci
and Lucas perfect powers, \textit{Ann. Math.} \textbf{163}
(2006), 969--1018.

\bibitem{Dujella-Petho:1998}
A. Dujella and A. Peth\H{o}, A generalization of a theorem of Baker and
Davenport, {\it Quart. J. Math. Oxford Ser. (2)} \textbf{49} (1998), 291--306.

\bibitem{Lomeli-Hernandez:2019}
A. C. G. Lomel\'{i} and S. H. Hern\'andez, Repdigits as sums of two
Padovan numbers, {\it J. Integer Sequences} \textbf{22} (2019),
\href{https://cs.uwaterloo.ca/journals/JIS/VOL22/Lomeli/lomeli3.html}{Article 19.2.3}.

\bibitem{matveev}
E. M. Matveev, An explicit lower bound for a homogeneous rational
linear form in the logarithms of algebraic numbers, II, {\it Izv. Math.}
\textbf{64} (2000), 1217--1269.

\bibitem{de Weger:1989} B. M. M. de Weger, 
{\it Algorithms for Diophantine Equations},
Stichting Mathematisch Centrum, 1989.

\bibitem{de Weger:1997} B. M. M. de Weger, Padua and Pisa are
exponentially far apart, {\it Publ. Sec. Mat. Univ. Aut\`onoma Barcelona}
\textbf{41} (1997), 631--651.

\end{thebibliography}

\bigskip
\hrule
\bigskip

\noindent 2010 {\it Mathematics Subject Classification}:
Primary 11J86; Secondary 11B39. 

\noindent \emph{Keywords: } Padovan number, Perrin number, Fermat
number, linear form in logarithms, reduction method.


\bigskip
\hrule
\bigskip

\noindent (Concerned with sequences
\seqnum{A000931}, \seqnum{A001608}, and \seqnum{A019434}.)

\bigskip
\hrule
\bigskip

\vspace*{+.1in}
\noindent
Received October 19 2019;
revised versions received May 5 2020; May 6 2020; June 3 2020. 
Published in {\it Journal of Integer Sequences}, June 9 2020.

\bigskip
\hrule
\bigskip

\noindent
Return to
\htmladdnormallink{Journal of Integer Sequences home page}{https://cs.uwaterloo.ca/journals/JIS/}.
\vskip .1in


\end{document}

                                                                                

</pre></body></html>