A321531
a(n) is the maximum number of distinct directions between n non-attacking rooks on an n X n chessboard.
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”- A321531computable