%I #5 Mar 31 2012 13:21:13
%S 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 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 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 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 Here we use the encoding explained in A106486. A(i,j) = A(A106485(j),A106485(i)).
%H A. Karttunen, <a href="/A126000/a126000.scm.txt">Scheme-program for computing this sequence.</a>
%Y 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 nonn,tabl
%O 0,1
%A _Antti Karttunen_, Dec 18 2006