|
|
A252593
|
|
Number of ways to place 8 nonattacking queens on an n X n board.
|
|
1
|
|
|
0, 0, 0, 0, 0, 0, 0, 92, 13848, 636524, 14803480, 207667564, 2008758532, 14752426528, 87154016752, 432539436508, 1858901487620
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,8
|
|
COMMENTS
|
Conjectured recurrence order is 477 (see "Non-attacking chess pieces", p. 19). - Vaclav Kotesovec, Dec 19 2014
|
|
LINKS
|
Antal Pinter, Combinatorics, software for enumerating positions of non-attacking chess pieces.
I. Rivin, I. Vardi and P. Zimmermann, The n-queens problem, Amer. Math. Monthly, 101 (1994), 629-639.
|
|
FORMULA
|
a(n) = n^16/40320 - n^15/432 + 221*n^14/2160 + O(n^13). - Vaclav Kotesovec, Dec 19 2014
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|