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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A263635 Sprague-Grundy sequence G(i-Mark({1}, {2})). 1
 0, 1, 0, 1, 2, 0, 2, 0, 1, 0, 1, 0, 1, 0, 1, 0, 2, 0, 1, 0, 2, 0, 1, 0, 2, 0, 1, 0, 2, 0, 1, 0, 1, 0, 1, 0, 2, 0, 1, 0, 1, 0, 1, 0, 2, 0, 1, 0, 1, 0, 1, 0, 2, 0, 1, 0, 1, 0, 1, 0, 2, 0, 1, 0, 2, 0, 1, 0, 2, 0, 1, 0, 1, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 LINKS Eric Sopena, i-Mark: A new subtraction division game, arXiv:1509.04199 [cs.DM], 2015. FORMULA a(n)=0 iff n=0, n=2, or n>=5 is odd. a(n)=1 iff n=3*2^k for even k>0 or n=(2*j+1)*2^k for integers j>1 and odd k. a(n)=2 otherwise. CROSSREFS Sequence in context: A224937 A035193 A004556 * A336121 A214332 A164734 Adjacent sequences:  A263632 A263633 A263634 * A263636 A263637 A263638 KEYWORD nonn AUTHOR N. J. A. Sloane, Oct 29 2015 EXTENSIONS More terms and formula from Nathan Fox, Dec 22 2015 STATUS approved

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.

Last modified June 15 08:52 EDT 2021. Contains 345048 sequences. (Running on oeis4.)