Abstract
Abstract Let (Pn ) n≥0 be the sequence of Padovan numbers defined by P 0 = 0, P 1 = 1 = P 2, and P n+3 = P n+1 +Pn for all n ≥ 0. In this paper, we find all Padovan numbers that are concatenations of two distinct repdigits.
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
