Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Lomelí et al. (2023) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: