|
Search: id:A019317
|
|
|
| A019317 |
|
Place n queens on an n X n board so as to leave the maximal number of unattacked squares; sequence gives number of different solutions. |
|
+0
2
|
|
| 1, 2, 16, 25, 1, 3, 38, 7, 1, 1, 2, 7, 1, 4, 3, 1
(list; graph; listen)
|
|
|
|
|
Search completed in 0.002 seconds
|
