Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #20 Jan 01 2018 04:13:23
%S 0,1,0,0,0,0,0,0,0,0,0,0,0,0,2,10,0,0,0,0,0,0,0,0,0,4,0,0,28,0,0,0,0,
%T 0,12,0,0,0,0,0,64,0,28,0,0,0,0,0,0,232,8,32,48,32
%N Triangle read by rows: number of solutions of n queens problem for given n and given number of queens engaged in conflicts.
%C Schlude and Specker investigate if it is possible to set n-1 non-attacking queens on an n X n toroidal chessboard. That is equivalent to searching for normal (i.e., non-toroidal) solutions of 3 engaged queens. In this case, one of the three queens has conflicts with both other queens. If you remove this queen, you get a setting of n-1 queens without conflicts, i.e., a toroidal solution.
%H M. Engelhardt, <a href="/A181500/b181500.txt">Rows n=0..16 of triangle, flattened</a>
%H Matthias Engelhardt, <a href="http://nqueens.de/sub/Conflicts.en.html">Conflicts in the n-queens problem</a>
%H Matthias Engelhardt, <a href="http://nqueens.de/sub/Conflicts.en.html">Conflict tables for the n-queens problem</a>
%H M. R. Engelhardt, <a href="http://dx.doi.org/10.1016/j.disc.2007.01.007">A group-based search for solutions of the n-queens problem</a>, Discr. Math., 307 (2007), 2535-2551.
%H Konrad Schlude and Ernst Specker, <a href="https://doi.org/10.3929/ethz-a-006666110">Zum Problem der Damen auf dem Torus</a>, Technical Report 412, Computer Science Department ETH Zurich, 2003.
%F Row sum = A000170 (number of n-queen placements).
%F Column 0 has same values as A007705 (torus n-queen solutions).
%F Columns 1 and 2 are always zero.
%F Column 3 counts solutions of the special "Schlude-Specker" situation.
%e Triangle begins:
%e 0;
%e 1, 0;
%e 0, 0, 0;
%e 0, 0, 0, 0;
%e 0, 0, 0, 0, 2;
%e 10, 0, 0, 0, 0, 0;
%e 0, 0, 0, 0, 4, 0, 0;
%e 28, 0, 0, 0, 0, 0, 12, 0;
%e ... - _Andrew Howroyd_, Dec 31 2017
%e For n=4, there are only the two solutions 2-4-1-3 and 3-1-4-2. For both solutions, all 4 queens are engaged in conflicts. So the terms for n=4 are 0 (0 solutions for n=4 having 0 engaged queens), 0, 0, 0 and 2 (the two cited above). These are members 11 to 15 of the sequence.
%Y Cf. A181499, A181501, A181502.
%K nonn,tabl
%O 0,15
%A _Matthias Engelhardt_, Oct 30 2010
%E Offset corrected by _Andrew Howroyd_, Dec 31 2017