Total number of ways to place k nonattacking bishops on an n X n chess board. Triangle T(n,k) read by rows (0 <= k <= 2*n-[n>0]-[n>1]).
A378590
Total number of ways to place k nonattacking bishops on an n X n chess board. Triangle T(n,k) read by rows (0 <= k <= 2*n-[n>0]-[n>1]).
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =4a(5) =4a(6) =1a(7) =9a(8) =26a(9) =26a(10) =8a(11) =1a(12) =16a(13) =92a(14) =232a(15) =260a(16) =112a(17) =16a(18) =1a(19) =25a(20) =240a(21) =1124a(22) =2728a(23) =3368a(24) =1960a(25) =440a(26) =32a(27) =1a(28) =36a(29) =520
External references
- oeis: A378590