|
|
A119466
|
|
Consider the standard game of Nim with 3 heaps and make a list of the losing positions (x,y,z) with x <= y <= z sorted by sum, ties broken by putting smallest value of x first, then y, then z; sequence gives z values.
|
|
6
|
|
|
0, 1, 2, 3, 3, 4, 5, 5, 6, 6, 7, 7, 7, 7, 6, 8, 9, 9, 10, 10, 11, 11, 11, 11, 10, 12, 12, 13, 13, 13, 13, 12, 14, 14, 14, 14, 12, 15, 15, 15, 15, 14, 15, 15, 14, 15, 13, 15, 14, 13, 12, 16, 17, 17, 18, 18, 19, 19, 19, 19, 18, 20, 20, 21, 21, 21, 21, 20, 22, 22, 22, 22, 20, 23, 23
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
|