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.

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.

Terms

    a(0) =1a(1) =20a(2) =400a(3) =1862a(4) =9373a(5) =51323a(6) =298821a(7) =1965313a(8) =11759158a(9) =66434263a(10) =365037821a(11) =1895313862

External references