login

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”).

A261595
Triangular array T(n, k) read by rows (n >= 1, 1 <= k <= n): row n gives the lexicographically earliest doubly centro-symmetric characteristic solution to the n queens problem, or n zeros if no doubly centro-symmetric characteristic solution exists. The k-th queen is placed in square (k, T(n, k)).
2
1, 0, 0, 0, 0, 0, 2, 4, 1, 3, 2, 5, 3, 1, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
OFFSET
1,7
COMMENTS
See the comments under A260318.
REFERENCES
Maurice Kraitchik: Mathematical Recreations. Mineola, NY: Dover, 2nd ed. 1953, pp. 247-255 (The Problem of the Queens).
EXAMPLE
n = 1: 1 is the trivial solution.
2 <= n < 4: no doubly centro-symmetric solutions exist.
n = 4: 2413 is the first and only solution.
.*..
...*
*...
..*.
n = 5: 25314 is the first and only solution.
6 <= n < 12: no doubly centro-symmetric solutions exist.
Triangle starts:
1;
0, 0;
0, 0, 0;
2, 4, 1, 3;
2, 5, 3, 1, 4;
0, 0, 0, 0, 0, 0;
...
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Martin Renner, Aug 25 2015
STATUS
approved