A115562
a(n) = number of distinct squarefree ternary (cyclic) sequences uniquely containing every possible length-n substring.
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”- A115562computable