A194498 T(n,k)=Number of ways to arrange k nonattacking queens on the lower triangle of an n X n board.
1, 0, 3, 0, 0, 6, 0, 0, 2, 10, 0, 0, 0, 12, 15, 0, 0, 0, 0, 38, 21, 0, 0, 0, 0, 12, 92, 28, 0, 0, 0, 0, 0, 82, 188, 36, 0, 0, 0, 0, 0, 8, 330, 344, 45, 0, 0, 0, 0, 0, 0, 118, 1008, 580, 55, 0, 0, 0, 0, 0, 0, 4, 802, 2566, 920, 66, 0, 0, 0, 0, 0, 0, 0, 114, 3708, 5742, 1390, 78, 0, 0, 0, 0, 0, 0, 0
Offset: 1
Examples
Some solutions for n=6 k=4 ..0............0............0............0............0............0 ..0.0..........0.0..........0.1..........0.0..........1.0..........0.1 ..1.0.0........1.0.0........0.0.0........0.0.1........0.0.1........0.0.0 ..0.0.1.0......0.0.0.1......0.0.1.0......1.0.0.0......0.0.0.0......1.0.0.0 ..0.0.0.0.1....0.1.0.0.0....1.0.0.0.0....0.0.0.1.0....0.1.0.0.0....0.0.1.0.0 ..0.1.0.0.0.0..0.0.0.0.1.0..0.0.0.1.0.0..0.1.0.0.0.0..0.0.0.1.0.0..0.0.0.0.1.0
Links
- R. H. Hardin, Table of n, a(n) for n = 1..518
Comments