login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A285875 Number of possible chess games at the end of the n-th ply starting without knights. 7
1, 18, 324, 6572, 132640, 3030492, 68633066, 1733220521, 43321058602, 1182486223832 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
Gives the number of possible chess games where both sides start without knights. Knights are still allowed to appear later in the game through promotion.
Does not include games which end in fewer than n plies.
The total number of such games should be less than the total number of standard chess games, and it appears A285875(n) <= A048987(n) for all n.
Initial terms computed using the Chesspresso engine.
LINKS
EXAMPLE
a(1) = 18 because each pawn can move forward 1 or 2 squares (16 moves) and each rook can move into the square where the knight would have been (2 moves).
CROSSREFS
Cf. A048987 (standard), A285873 (no queens), A285874 (no rooks), A285876 (no bishops), A285877 (no pawns), A285878 (pawns and king).
Sequence in context: A285878 A171292 A001027 * A223311 A041145 A041614
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 6 10:12 EDT 2024. Contains 372293 sequences. (Running on oeis4.)