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.
%I A285876 #6 May 04 2017 00:04:32 %S A285876 1,22,484,11248,260904,6434922,158069690,4126252938,107097735673, %T A285876 2940365284820 %N A285876 Number of possible chess games at the end of the n-th ply starting without bishops. %C A285876 Gives the number of possible chess games where both sides start without bishops. %C A285876 Does not include games which end in fewer than n plies. %C A285876 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. %C A285876 Initial terms computed using the Chesspresso engine. %H A285876 <a href="http://www.chesspresso.org/">Chesspresso<sup>TM</sup></a>. %e A285876 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. %Y A285876 Cf. A048987 (standard), A285873 (no queens), A285874 (no rooks), A285875 (no knights), A285877 (no pawns), A285878 (pawns and king). %K A285876 nonn,hard,more,fini %O A285876 0,2 %A A285876 _Sean A. Irvine_, Apr 28 2017