%I #19 Jan 01 2018 04:51:14
%S 0,1,0,0,0,0,0,0,0,0,0,0,2,0,0,10,0,0,0,0,0,0,4,0,0,0,0,0,28,0,4,8,0,
%T 0,0,0,0,0,92,0,0,0,0,0,0,0,8,272,56,16,0,0,0,0,0,0,96,344,240,44,0,0,
%U 0,0,0,0
%N Triangle read by rows: number of solutions of n queens problem for given n and given number of connection components of conflict constellation
%C The rightmost part of the triangle contains only zeros. As any connection component needs at least two queens, the number of connection components of a solution is always less than or equal to n.
%H M. Engelhardt, <a href="/A181501/b181501.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/ConflictTables.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.
%F Row sum =A000170 (number of n queens placements)
%F Column 0 has same values as A007705 (torus n queens solutions)
%e Triangle begins:
%e 0;
%e 1, 0;
%e 0, 0, 0;
%e 0, 0, 0, 0;
%e 0, 0, 2, 0, 0;
%e 10, 0, 0, 0, 0, 0;
%e 0, 4, 0, 0, 0, 0, 0;
%e 28, 0, 4, 8, 0, 0, 0, 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. Both have two connection components in the conflicts graph. So, the terms for n=4 are 0, 0, 2 (the two cited above), 0 and 0. These are members 10 to 15 of the sequence.
%Y Cf. A000170, A007705, A181499, A181500, A181502.
%K nonn,tabl
%O 0,13
%A _Matthias Engelhardt_, Oct 30 2010
%E Offset corrected by _Andrew Howroyd_, Dec 31 2017