Repdigits as sums of three Padovan numbers
Abstract
Let \Pn\n≥ 0 be the sequence of Padovan numbers defined by P0=0 , P1 =1=P2 and Pn+3= Pn+1 +Pn for all n≥ 0 . In this paper, we find all repdigits in base 10 which can be written as a sum of three Padovan numbers.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.