Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A102784
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A102784 In chess, the number of "at home" dual-free proof games in n plies. +0
2
1, 0, 0, 0, 0, 0, 0, 0, 10, 41, 116, 335, 1111, 2619, 6067 (list; graph; listen)
OFFSET

0,9

COMMENT

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

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: A003355 A022278 A006323 this_sequence A061003 A048879 A089211

Adjacent sequences: A102781 A102782 A102783 this_sequence A102785 A102786 A102787

KEYWORD

hard,nonn

AUTHOR

Francois Labelle (flab(AT)cs.berkeley.edu), Feb 11 2005

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research