Number of different ways one can attack all squares on an n X n chessboard with the smallest number of non-attacking queens needed.

A002568

Number of different ways one can attack all squares on an n X n chessboard with the smallest number of non-attacking queens needed.

Terms

    a(0) =1a(1) =4a(2) =1a(3) =16a(4) =16a(5) =120a(6) =8a(7) =728a(8) =92a(9) =8a(10) =2a(11) =840a(12) =24a(13) =436a(14) =10188a(15) =128a(16) =12a(17) =224a(18) =8424a(19) =312a(20) =72a(21) =192a(22) =8784a(23) =368a(24) =56a(25) =224a(26) =14500a(27) =280a(28) =10880a(29) =240

External references