A335753
Maximal length of the shortest walk on any n X n maze that starts in one corner and visits the other three corners.
offset: 2
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”- A335753computable