|
Search: id:A103331
|
|
|
| A103331 |
|
Number of ways to place n+1 queens and a pawn 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, 2, 3, 16, 52, 286, 1403, 8214, 54756, 389833, 2923757, 22932960, 184339572
(list; graph; listen)
|
|
|
Search completed in 0.002 seconds
|
