The sequence known as Narayana’s cows sequence is defined by the thirdorder linear recurrence relation Nn = Nn−1 + Nn−3, for n ≥ 3, with the initial values given by N0 = N1 = N2 = 1. In this paper, we explore the class of numbers known as brepdigits that can be represented as the sum of three terms from this sequence. Specifically, we aim to identify all such numbers for bases in the range 2 ≤ b ≤ 30. Our approach relies on precise lower bounds for linear forms in logarithms, along with an enhanced version of the Baker-Davenport reduction method applied to Diophantine equations.
Tiebekabe et al. (Thu,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: