Triangle read by rows: T(n,k) = number of configurations of k nonattacking bishops on the black squares of an n X n chessboard (0 <= k <= n - [n>1]).
A274105
Triangle read by rows: T(n,k) = number of configurations of k nonattacking bishops on the black squares of an n X n chessboard (0 <= k <= n - [n>1]).
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =1a(6) =5a(7) =4a(8) =1a(9) =8a(10) =14a(11) =4a(12) =1a(13) =13a(14) =46a(15) =46a(16) =8a(17) =1a(18) =18a(19) =98a(20) =184a(21) =100a(22) =8a(23) =1a(24) =25a(25) =206a(26) =674a(27) =836a(28) =308a(29) =16
External references
- oeis: A274105