|
|
A181502
|
|
Triangle read by rows: number of solutions of n queens problem for given n and given maximal size of a connection component in the conflict constellation
|
|
4
|
|
|
0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 10, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 28, 8, 4, 0, 0, 0, 0, 0, 0, 64, 24, 4, 0, 0, 0, 0, 0, 0, 248, 80, 16, 8, 0, 0, 0, 0, 0, 0, 172, 484, 36, 32, 0, 0, 0
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,13
|
|
COMMENTS
|
Torus solutions, i.e. solutions having an empty conflict constellation, are counted in column 1; this is caused by an interpretation of a queen not engaged in any conflict as an island in the conflict graph. Using the definition strictly, these queens should be removed from the graph and the numbers should appear in column 0, not column 1.
|
|
LINKS
|
|
|
FORMULA
|
Row sum =A000170 (number of n queens placements)
Column 1 has same values as A007705 (torus n queens solutions)
Column 0 is always zero.
|
|
EXAMPLE
|
Triangle begins:
0;
0, 1;
0, 0, 0;
0, 0, 0, 0;
0, 0, 2, 0, 0;
0, 10, 0, 0, 0, 0;
0, 0, 0, 0, 4, 0, 0;
0, 28, 8, 4, 0, 0, 0, 0;
for n=4, there are only the two solutions 2-4-1-3 and 3-1-4-2. Both have two conflicts So the terms for n=4 are 0 (0 solutions for n=4 having 0 conflicts), 0, 2 (the two cited above), 0 and 0. These are members 10 to 15 of the sequence.
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|