|
| |
|
|
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.
|
|
3
| |
|
|
1, 20, 400, 1862, 9373, 51323, 298821, 1965313, 11759158, 66434263, 365037821
(list; graph; refs; listen; history; internal format)
|
| |
| |
|
|