|
Search: id:A129554
|
|
|
| A129554 |
|
Number of ways to place n+3 queens and 3 pawns on an n X n board so that no two queens attack each other (symmetric solutions count only once). |
|
+0
2
|
|
| 0, 0, 0, 0, 0, 0, 0, 1, 6, 66, 751, 9737, 131672, 1708295
(list; graph; listen)
|
|
|
Search completed in 0.001 seconds
|
