

A126010


Square array A(g,h) = 1 if combinatorial games g and h have the same value, 0 if they differ, listed antidiagonally in order A(0,0), A(1,0), A(0,1), A(2,0), A(1,1), A(0,2), ...


4



1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,1


COMMENTS

Here we use the encoding described in A106486.


LINKS

Table of n, a(n) for n=0..119.
A. Karttunen, Schemeprogram for computing this sequence.


EXAMPLE

A(4,5) = A(5,4) = 1 because 5 encodes the game {0,1}, where, because the option 1 dominates the option 0 on the left side, the zero can be deleted, resulting the game {1}, the canonical form of the game 2, which is encoded as 4.


CROSSREFS

Row 0 is the characteristic function of A125991 (shifted one step). A(i, j) = A125999(i, j)*A125999(j, i). A126011 gives the A106486encodings for the minimal representatives of each equivalence class of finite combinatorial games.
Sequence in context: A014049 A016371 A003982 * A015857 A016343 A016193
Adjacent sequences: A126007 A126008 A126009 * A126011 A126012 A126013


KEYWORD

nonn,tabl


AUTHOR

Antti Karttunen, Dec 18 2006


STATUS

approved



