Conjecture on the rarity of block repdigits in Narayana's cows sequence
Statement
Let be the Narayana sequence, and let an -block repdigit be a positive integer formed by repeating the same decimal block of length at least twice. Block-repdigit rarity conjecture. For every integer , the Narayana sequence contains no -block repdigits of length at least . This extends the preceding results for one- and two-block repdigits; whether such repdigits can occur for arbitrary block length remains open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.