

A332587


a(n) = least m such that there is a component of a certain pawn game based on a word of length m that is equivalent to a Nimheap of size n.


0



1, 4, 6, 9, 11, 14, 16, 20, 22, 25, 27, 30, 32, 37, 39, 43
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


REFERENCES

Noam D. Elkies, Higher Nimbers in pawn endgames on large chessboards, pages 6178 in More Games of No Chance, R. J. Nowakowski, ed.; MSRI Publ. #42, 2002 via Cambridge Univ. Press; Proceedings of the 7/00 MSRI Workshop on Combinatorial Games. See Section 6.3.


LINKS

Table of n, a(n) for n=1..16.
Noam D. Elkies, Higher Nimbers in pawn endgames on large chessboards, arXiv:math/0011253 [math.CO], 2000. See Section 6.3.


CROSSREFS

Sequence in context: A010411 A047209 A138812 * A003259 A020935 A267149
Adjacent sequences: A332584 A332585 A332586 * A332588 A332589 A332590


KEYWORD

nonn,more


AUTHOR

N. J. A. Sloane, Feb 28 2020


STATUS

approved



