Abstract
Abstract Let {P n}n≥0 be the sequence of Padovan numbers defined by P0 = 0, P1 = 1, P2 = 1, and Pn+3 = Pn+1 + Pn for all n ≥ 0. In this paper, we find all integers c admitting at least two representations as a difference between a Padovan number and a power of 3.
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
