login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 Nim-heap of size n. 0

%I

%S 1,4,6,9,11,14,16,20,22,25,27,30,32,37,39,43

%N 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 Nim-heap of size n.

%D Noam D. Elkies, Higher Nimbers in pawn endgames on large chessboards, pages 61-78 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.

%H Noam D. Elkies, <a href="https://arxiv.org/abs/math/0011253">Higher Nimbers in pawn endgames on large chessboards</a>, arXiv:math/0011253 [math.CO], 2000. See Section 6.3.

%K nonn,more

%O 1,2

%A _N. J. A. Sloane_, Feb 28 2020

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 18 22:36 EDT 2021. Contains 344005 sequences. (Running on oeis4.)