login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A209080 Number 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. 2
1, 20, 400, 1702, 8659, 49401, 287740, 1934794, 11569093, 65443733, 360231372, 1872156836 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

Chess diagrams are chess positions without regard to whether castling or en passant capturing is possible. They are counted in A019319. A shortest proof game (SPG) is a classic type of chess problem. Most published SPGs are dual-free (have only one solution), which is why we count diagrams that are obtained in exactly one way in the minimum number of plies.

LINKS

Table of n, a(n) for n=0..11.

F. Labelle, Statistics on chess positions

Index entries for sequences related to number of chess games

CROSSREFS

Cf. A019319, A090051, A209433.

Sequence in context: A207372 A208017 A208559 * A090051 A089957 A267718

Adjacent sequences:  A209077 A209078 A209079 * A209081 A209082 A209083

KEYWORD

nonn,hard,fini,more

AUTHOR

François Labelle, Mar 04 2012

EXTENSIONS

a(11) from François Labelle, Feb 27 2017

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 26 01:22 EST 2020. Contains 338631 sequences. (Running on oeis4.)