Abstract
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 completely solve the Diophantine equation Pn = 6a ± 6b ± 6c in non-negative integers (n, a, b, c) with a > b > c > 0.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
