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 A202258 #8 Sep 20 2013 11:34:39 %S A202258 8,6,5,5,4 %N A202258 Minimum number of laps for a starting player's win in Dakon-n. %C A202258 Dakon-n is the game of Dakon with n small holes per player. This sequence records the minimum number of times a starting player can lap the board, while winning on the first turn. The best-known value for n=9,10 is 5. %D A202258 J. Donkers, A. de Voogt and J. Uiterwijk, Human versus Machine Problem-Solving: Winning Openings in Dakon, Board Game Studies 3 (2000), 79-88. %K A202258 nonn %O A202258 4,1 %A A202258 _George Pollard_, Dec 15 2011