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



(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


%S 1,0,0,0,0,0,0,0,10,41,116,335,1111,2619,6067,12788,26692

%N In chess, the number of "at home" dual-free proof games in n plies.

%C 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.

%H A. Buchanan, <a href="http://anselan.com/CHE.html">"At Home" proof games</a>

%H F. Labelle, <a href="http://www.cs.berkeley.edu/~flab/chess/statistics-positions.html#at-home">Statistics on "at home" diagrams</a>

%H F. Labelle, <a href="http://www.pairlist.net/pipermail/retros/2005-February/001041.html">Mailing list posting about the computation up to ply 14</a>

%Y Cf. A090051.

%K hard,nonn,fini

%O 0,9

%A _Fran├žois Labelle_, Feb 11 2005

%E a(15)-a(16) from _Fran├žois Labelle_, Apr 01 2015

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 July 12 11:11 EDT 2020. Contains 335658 sequences. (Running on oeis4.)