login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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)
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 proof game is a classic type of chess problem.

LINKS

F. Labelle, Statistics on chess positions

Index entries for sequences related to number of chess games

CROSSREFS

Cf. A019319, A089957.

Sequence in context: A171325 A075843 A207372 * A089957 A207402 A207127

Adjacent sequences:  A090048 A090049 A090050 * A090052 A090053 A090054

KEYWORD

nonn,hard,nice

AUTHOR

Francois Labelle (flab(AT)cs.berkeley.edu), Jan 19 2004

EXTENSIONS

a(9)-a(10) from Arkadiusz Wesolowski, Jan 04 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 22:48 EST 2012. Contains 206085 sequences.