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), ...

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, 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, 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

Offset

0,1

Comments

Here we use the encoding explained in A106486. A(i,j) = A(A106485(j),A106485(i)).

Links

Table of n, a(n) for n=0..119.

A. Karttunen, Scheme-program for computing this sequence.

Crossrefs

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.

Sequence in context: A133081 A352573 A285345 * A073784 A320006 A219977

Adjacent sequences: A125996 A125997 A125998 * A126000 A126001 A126002

Keyword

nonn,tabl

Author

Antti Karttunen, Dec 18 2006

Status

approved