Number of different ways one can attack all squares on an n X n chessboard using the minimum number of queens.
A002564
Number of different ways one can attack all squares on an n X n chessboard using the minimum number of queens.
Terms
- a(0) =1a(1) =4a(2) =1a(3) =12a(4) =186a(5) =4a(6) =86a(7) =4860a(8) =114a(9) =8a(10) =2a(11) =8a(12) =288a(13) =4632a(14) =205832a(15) =2968a(16) =124a(17) =16a(18) =84
External references
- oeis: A002564