A307300 Array read by antidiagonals: Sprague-Grundy values for the game NimHof with rules [1,0], [2,2], [0,1].

0, 1, 1, 2, 0, 2, 3, 3, 3, 3, 4, 2, 1, 2, 4, 5, 5, 0, 0, 5, 5, 6, 4, 6, 1, 6, 4, 6, 7, 7, 7, 7, 7, 7, 7, 7, 8, 6, 5, 6, 2, 6, 5, 6, 8, 9, 9, 4, 4, 3, 3, 4, 4, 9, 9, 10, 8, 10, 5, 0, 2, 0, 5, 10, 8, 10, 11, 11, 11, 11, 1, 1, 1, 1, 11, 11, 11, 11, 12, 10

Offset

0,4

Comments

The game NimHof with a list of rules R means that for each rule [a,b] you can move from cell [x,y] to any cell [x-i*a,y-i*b] as long as neither coordinate is negative. See the Friedman et al. article for further details.

References

Eric Friedman, Scott M. Garrabrant, Ilona K. Phipps-Morgan, A. S. Landsberg and Urban Larsson, Geometric analysis of a generalized Wythoff game, in Games of no Chance 5, MSRI publ. Cambridge University Press, date?

Links

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

Rémy Sigrist, Colored representation of T(x,y) for x = 0..999 and y = 0..999 (where the hue is function of T(x,y) and black pixels correspond to zeros)

Rémy Sigrist, PARI program for A307300

N. J. A. Sloane, Maple program for NimHof sequences

Example

The initial antidiagonals are:
[0]
[1, 1]
[2, 0, 2]
[3, 3, 3, 3]
[4, 2, 1, 2, 4]
[5, 5, 0, 0, 5, 5]
[6, 4, 6, 1, 6, 4, 6]
[7, 7, 7, 7, 7, 7, 7, 7]
[8, 6, 5, 6, 2, 6, 5, 6, 8]
[9, 9, 4, 4, 3, 3, 4, 4, 9, 9]
[10, 8, 10, 5, 0, 2, 0, 5, 10, 8, 10]
[11, 11, 11, 11, 1, 1, 1, 1, 11, 11, 11, 11]
[12, 10, 9, 10, 12, 0, 3, 0, 12, 10, 9, 10, 12]
...
The triangle begins:
[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]
[1, 0, 3, 2, 5, 4, 7, 6, 9, 8, 11, 10]
[2, 3, 1, 0, 6, 7, 5, 4, 10, 11, 9]
[3, 2, 0, 1, 7, 6, 4, 5, 11, 10]
[4, 5, 6, 7, 2, 3, 0, 1, 12]
[5, 4, 7, 6, 3, 2, 1, 0]
[6, 7, 5, 4, 0, 1, 3]
[7, 6, 4, 5, 1, 0]
[8, 9, 10, 11, 12]
[9, 8, 11, 10]
[10, 11, 9]
[11, 10]
[12]
...

Prog

(PARI) See Links section.

Crossrefs

Cf. A003987, A307296, A307297.

Sequence in context: A307302 A307297 A307301 * A354438 A354470 A141692

Adjacent sequences: A307297 A307298 A307299 * A307301 A307302 A307303

Keyword

nonn,tabf

Author

N. J. A. Sloane, Apr 13 2019

Status

approved