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.

Original entry on oeis.org

1, 0, 0, 0, 0, 0, 0, 0, 10, 41, 116, 335, 1111, 2619, 6067, 12788, 26692
Offset: 0

Views

Author

François Labelle, Feb 11 2005

Keywords

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.

Crossrefs

Cf. A090051.

Extensions

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