Number of distinct ways to place bishops (up to 2n-2) on an n X n chessboard so that no bishop is attacking another and that it is not possible to add another bishop.
A146304
Number of distinct ways to place bishops (up to 2n-2) on an n X n chessboard so that no bishop is attacking another and that it is not possible to add another bishop.
Terms
- a(0) =1a(1) =4a(2) =10a(3) =64a(4) =660a(5) =7744a(6) =111888a(7) =1960000a(8) =40829184a(9) =989479936a(10) =27559645440a(11) =870414361600
External references
- oeis: A146304