|
Search: id:A090051
|
|
|
| A090051 |
|
Number of chess diagrams that can be obtained in exactly one way in n plies. This is also the number of dual-free proof games in n plies. |
|
+0
4
|
|
| 1, 20, 400, 1862, 9373, 51323, 298821, 1965313, 11759158
(list; graph; listen)
|
|
|
Search completed in 0.002 seconds
|
