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 A125999 #5 Mar 31 2012 13:21:13 %S A125999 1,1,0,0,1,1,0,0,1,0,1,0,1,1,0,1,1,1,0,0,0,0,1,1,1,0,0,0,0,0,1,1,0,0, %T A125999 0,0,1,0,1,1,1,0,0,0,1,1,0,1,1,1,1,0,0,1,0,0,0,1,1,0,1,1,0,0,1,1,0,0, %U A125999 1,0,0,0,1,1,0,0,1,0,1,0,1,1,0,0,1,1,1,0,1,1,0,1,0,1,0,0,0,1,1,1,1,1,0,0,0,0,0,1,1,0,0,0,1,0,1,1,1,0,0,0 %N A125999 Square array A(g,h) = 1 if combinatorial game g has value greater than or equal to that of game h, otherwise 0, listed antidiagonally in order A(0,0), A(1,0), A(0,1), A(2,0), A(1,1), A(0,2), ... %C A125999 Here we use the encoding explained in A106486. A(i,j) = A(A106485(j),A106485(i)). %H A125999 A. Karttunen, <a href="/A126000/a126000.scm.txt">Scheme-program for computing this sequence.</a> %Y A125999 Row 0 is the characteristic function of A126001 (shifted one step) and similarly, column 0 is the characteristic function of A126002. Cf. tables A126010 and A126000. %K A125999 nonn,tabl %O A125999 0,1 %A A125999 _Antti Karttunen_, Dec 18 2006