The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A252593 Number of ways to place 8 nonattacking queens on an n X n board. 0
 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 S. Chaiken, C. R. H. Hanusa and T. Zaslavsky, A q-Queens Problem, I. General theory, arXiv:1303.1879 [math.CO], 2013-2014. V. Kotesovec, Non-attacking chess pieces, 6ed, 2013 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 Cf. A000170, A036464, A047659, A061994, A108792, A176186, A178721. Sequence in context: A267787 A267734 A146503 * A146515 A252631 A191948 Adjacent sequences:  A252590 A252591 A252592 * A252594 A252595 A252596 KEYWORD nonn,hard,more AUTHOR Antal Pinter, Dec 18 2014 EXTENSIONS a(16) from Vaclav Kotesovec, Dec 19 2014 a(17) from Vaclav Kotesovec, Dec 20 2014 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 12 16:16 EDT 2021. Contains 342921 sequences. (Running on oeis4.)