On solutions of the Diophantine equation ${\mathcal{P}}_m-L_n=c$

\noindent In this article, we determine all the integers $c$ having at least two representations as difference between two linear recurrent sequences. This is a variant of the Pillai’s equation. This equation is an exponential Diophantine equation. The proof of our main theorem uses lower bounds for linear forms of logarithms, properties of continued fractions, and a version of the Baker-Davenport reduction method in Diophantine approximation.