|
Search: id:A140393
|
|
|
| A140393 |
|
Number of ways of placing n nonattacking queens on n X n board (version computed by NQueens(AT)home). |
|
+0
2
|
|
| 1, 0, 0, 2, 10, 4, 40, 92, 352, 724, 2680, 14200, 73712, 365596, 2279184, 14772512, 95815104, 666090624, 4968057848, 39029188884, 314666222712, 2691008701644, 24233937684440, 226732487925864
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
COMMENT
|
This is a new calculation of A000170 which produced a different answer for n=24. I do not know which version is correct and I have therefore created this second entry for the values found by the NQueens(AT)home team. See the main entry for this sequence, A000170, for many further references and comments.
As discovered on Nov 07, 2008, this sequence is likely to suffer from an overflow error in the implementation of the NQueens(AT)Home project. The results differ by 781684047872 = 0xb600000000.
|
|
LINKS
|
NQuens(AT)home, Home Page
|
|
CROSSREFS
|
See A000170 for further information.
Sequence in context: A102512 A029673 A054790 this_sequence A000170 A038216 A145911
Adjacent sequences: A140390 A140391 A140392 this_sequence A140394 A140395 A140396
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Jun 18 2008
|
|
EXTENSIONS
|
a(24) is probably mistaken. - Thomas B. Preusser (thomas.preusser(AT)tu-dresden.de), Nov 07 2008
|
|
|
Search completed in 0.002 seconds
|
