1934794domain: NAppears in sequencesNumber of chess diagrams that can be obtained in exactly one way in n plies and cannot be obtained in fewer plies. This is also the number of dual-free shortest proof games in n plies.at n=7A209080