Triangle read by rows: T(n,k) = total number of configurations of k nonattacking bishops on the white squares of an n X n chessboard (0 <= k <= n-1+[n=0]).

A274106

Triangle read by rows: T(n,k) = total number of configurations of k nonattacking bishops on the white squares of an n X n chessboard (0 <= k <= n-1+[n=0]).

Terms

    a(0) =1a(1) =1a(2) =1a(3) =2a(4) =1a(5) =4a(6) =2a(7) =1a(8) =8a(9) =14a(10) =4a(11) =1a(12) =12a(13) =38a(14) =32a(15) =4a(16) =1a(17) =18a(18) =98a(19) =184a(20) =100a(21) =8a(22) =1a(23) =24a(24) =188a(25) =576a(26) =652a(27) =208a(28) =8a(29) =1

External references