cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A102784 #8 Apr 02 2015 09:48:51
%S A102784 1,0,0,0,0,0,0,0,10,41,116,335,1111,2619,6067,12788,26692
%N A102784 In chess, the number of "at home" dual-free proof games in n plies.
%C A102784 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 A102784 A. Buchanan, <a href="http://anselan.com/CHE.html">"At Home" proof games</a>
%H A102784 F. Labelle, <a href="http://www.cs.berkeley.edu/~flab/chess/statistics-positions.html#at-home">Statistics on "at home" diagrams</a>
%H A102784 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 A102784 Cf. A090051.
%K A102784 hard,nonn,fini
%O A102784 0,9
%A A102784 _François Labelle_, Feb 11 2005
%E A102784 a(15)-a(16) from _François Labelle_, Apr 01 2015