You need to subscribe to download the article.
In this paper, applying the Primitive Divisor Theorem, we solve completely the diophantine equation
in non-negative integers , and if the binary recurrence is either the Fibonacci sequence, or the Lucas sequence, or it satisfies the recurrence relation with , and an arbitrary positive integer . The more specific case
was investigated by Marques  in Portugaliae Mathematica in the case of the Fibonacci sequence.