Number of ways to attack all squares on an n X n chessboard using the smallest possible number of queens with each queen attacking at least one other.
A002566
Number of ways to attack all squares on an n X n chessboard using the smallest possible number of queens with each queen attacking at least one other.
Terms
- a(0) =0a(1) =6a(2) =20a(3) =12a(4) =70a(5) =960a(6) =22a(7) =352a(8) =10a(9) =216a(10) =4814a(11) =72
External references
- oeis: A002566