Let (Pn)n≥0 be the Padovan sequence given by P0 = 0, P1 = P2 = 1 and the recurrence formula Pn+3 = Pn+1 + Pn for all n ≥ 0. In this note we study and completely solve the Diophantine equation Pn - 2m = Pn1 - 2m1 in non-negative integers (n, m, n1, m1).
