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 A275360 #5 Jul 24 2016 20:34:47 %S A275360 8,35,49,63,74,85,93,99,103,109,115 %N A275360 Maximum number of moves available to one side from a legal chess position with n pieces (with no additional pieces from promotion). %C A275360 For completeness: If a side has two Bishops, those Bishops must be on opposite-colored squares (as in the original board configuration). Four promotion moves (to Knight, Bishop, Rook, or Queen) are available per Pawn per promotion square. %C A275360 Sequence inspired by the Tim Krabbé link and a posting by Bernhard Sadlowski to rec.games.chess.computer on Oct 30 1996 (giving the H. H. Cross position -- see this a-file -- which supports the a(32) lower bound). %C A275360 Terms a(13) through a(32) are respectively >= 119, 125, 129, 133, 137, 139, 140, 141, 143, 144, 144, 144, 144, 143, 142, 139, 128, 117, 105, 99. %H A275360 T. Krabbé, <a href="http://timkr.home.xs4all.nl/chess2/diary_10.htm">Open Chess Diary, Item 195, Nov 29 2002: Mobility records</a> %H A275360 Rick L. Shepherd, <a href="/A275360/a275360.txt">Positions supporting initial terms and lower bounds.</a> %K A275360 nonn,fini,more %O A275360 2,1 %A A275360 _Rick L. Shepherd_, Jul 24 2016