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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A102784 In chess, the number of "at home" dual-free proof games in n plies. 1
1, 0, 0, 0, 0, 0, 0, 0, 10, 41, 116, 335, 1111, 2619, 6067, 12788, 26692 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,9

COMMENTS

Among all the proof game problems counted in A090051, this is the number of problems where all the surviving pieces are apparently on their start squares.

LINKS

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

A. Buchanan, "At Home" proof games

F. Labelle, Statistics on "at home" diagrams

F. Labelle, Mailing list posting about the computation up to ply 14

CROSSREFS

Cf. A090051.

Sequence in context: A266396 A006323 A178073 * A294604 A061003 A211064

Adjacent sequences:  A102781 A102782 A102783 * A102785 A102786 A102787

KEYWORD

hard,nonn,fini

AUTHOR

François Labelle, Feb 11 2005

EXTENSIONS

a(15)-a(16) from François Labelle, Apr 01 2015

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified January 22 22:38 EST 2018. Contains 298093 sequences.