A180632
Minimum length of a string over the alphabet A = {1,2,…,n} that contains every permutation of A as a substring exactly once, also known as length of the minimal super-permutation.
offset: 0
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”- A180632computable