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 A285877 #6 May 04 2017 00:04:59 %S A285877 1,50,2125,96062,4200525,191462298,8509434855,390020597683 %N A285877 Number of possible chess games at the end of the n-th ply starting without pawns. %C A285877 Gives the number of possible chess games where both sides start without pawns. %C A285877 Does not include games which end in fewer than n plies. %C A285877 The initial terms exceed the corresponding terms in A048987, but this should eventually reverse and we should have A285877(n) <= A048987(n) for large enough n. %C A285877 Initial terms computed using the Chesspresso engine. %H A285877 <a href="http://www.chesspresso.org/">Chesspresso<sup>TM</sup></a>. %Y A285877 Cf. A048987 (standard), A285873 (no queens), A285874 (no rooks), A285875 (no knights), A285876 (no bishops), A285878 (pawns and king). %K A285877 nonn,hard,more,fini %O A285877 0,2 %A A285877 _Sean A. Irvine_, Apr 28 2017