A324149
Least integer x such that every set of the length-n subwords of some binary word y is achievable by taking the subwords of some word of length <= x.
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”- A324149computable