A332232
Smallest t such that every binary word of length t+1 contains two non-overlapping occurrences of some length-n block.
offset: 1
codomain: ℕ
The OEIS sequence has the tags “hard” and/or “more” and few known values. It is likely that the Lean code is not representing the actual sequence, even though it coincides in the known values.
Declarations
Section titled “Declarations”- A332232computable