A115992
Number of non-attacking queens that can be placed on a “hyper-chessboard” = hypercube of size 3, dimension n. That is, the size of the largest subset S of {0,1,2}^n such that for each pair (x0,y0,…), (x1,y1,…) of distinct elements of S, the absolute differences vector (|x1-x0|, |y1-y0|, …) has at least two distinct non-null coordinates.
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”- A115992computable