|
|
A125993
|
|
A106486-encodings of combinatorial games with value -1.
|
|
1
|
|
|
2, 10, 130, 138, 514, 522, 642, 650, 2050, 2058, 2178, 2186, 2562, 2570, 2690, 2698, 8194, 8202, 8322, 8330, 8706, 8714, 8834, 8842, 10242, 10250, 10370, 10378, 10754, 10762, 10882, 10890, 32770, 32778, 32898, 32906, 33282, 33290, 33410
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
These are codes for games which belong to the same equivalence class as the game {|0} (i.e. game -1).
|
|
LINKS
|
Table of n, a(n) for n=1..39.
A. Karttunen, Scheme-program for computing this sequence.
|
|
EXAMPLE
|
Game {|0} is encoded as 2^(1+2*0) = 2, thus 2 is the first term of this sequence. Also 10 belongs belongs into this sequence, as it encodes game {|0,1}, where, as the option 0 dominates the option 1, the latter can be deleted, resulting the same game {|0}. Likewise code 8589934592 (= 2^(1+(2*2^(2*2)))) belongs into this sequence, as it encodes the game {|{-1|}}, which is reversible to game -1.
|
|
CROSSREFS
|
Row 3 of A126000.
Sequence in context: A144835 A305028 A119191 * A185952 A258971 A011805
Adjacent sequences: A125990 A125991 A125992 * A125994 A125995 A125996
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Antti Karttunen, Dec 18 2006
|
|
STATUS
|
approved
|
|
|
|