Triangle read by rows: T(n,k) = number of configurations of k non-attacking bishops on the white squares of an n X n chessboard (for n even, 0 <= k < n).

A088960

Triangle read by rows: T(n,k) = number of configurations of k non-attacking bishops on the white squares of an n X n chessboard (for n even, 0 <= k < n).

Terms

    a(0) =1a(1) =2a(2) =1a(3) =8a(4) =14a(5) =4a(6) =1a(7) =18a(8) =98a(9) =184a(10) =100a(11) =8a(12) =1a(13) =32a(14) =356a(15) =1704a(16) =3532a(17) =2816a(18) =632a(19) =16a(20) =1a(21) =50a(22) =940a(23) =8480a(24) =38932a(25) =89256a(26) =93800a(27) =37600a(28) =3856a(29) =32

External references