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

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A285876 Number of possible chess games at the end of the n-th ply starting without bishops. 7
 1, 22, 484, 11248, 260904, 6434922, 158069690, 4126252938, 107097735673, 2940365284820 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Gives the number of possible chess games where both sides start without bishops. Does not include games which end in fewer than n plies. The initial terms exceed the corresponding terms in A048987, but this should eventually reverse and we should have A285876(n) <= A048987(n) for large enough n. Initial terms computed using the Chesspresso engine. LINKS EXAMPLE a(1) = 22 because we have the standard 20 opening moves, plus the queen and king can each move into the squares that would normally contain the bishops. CROSSREFS Cf. A048987 (standard), A285873 (no queens), A285874 (no rooks), A285875 (no knights), A285877 (no pawns), A285878 (pawns and king). Sequence in context: A223970 A171296 A009966 * A041221 A041926 A230350 Adjacent sequences:  A285873 A285874 A285875 * A285877 A285878 A285879 KEYWORD nonn,hard,more,fini AUTHOR Sean A. Irvine, Apr 28 2017 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 19 20:41 EST 2020. Contains 331066 sequences. (Running on oeis4.)