login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A263834 Sprague-Grundy sequence G(i-Mark({2,4}, {2})). 0
0, 0, 1, 1, 2, 2, 0, 0, 1, 1, 3, 2, 2, 0, 1, 1, 0, 2, 2, 0, 1, 1, 0, 2, 3, 0, 1, 1, 0, 2, 2, 0, 1, 1, 0, 2, 3, 0, 1, 1, 0, 2, 2, 0, 1, 1, 0, 2, 2, 0, 1, 1, 0, 2, 2, 0, 1, 1, 0, 2, 3, 0, 1, 1, 0, 2, 2, 0, 1, 1, 0, 2, 2, 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
For n>=11:
a(n) = 0 if n = 1 (mod 6)
a(n) = 1 if n = 2 (mod 6)
a(n) = 1 if n = 3 (mod 6)
a(n) = 0 if n = 4 (mod 6)
a(n) = 2 if n = 5 (mod 6)
a(n) = 2 if n = 0 (mod 6) and (n/6 is odd or n/6=2^k for even k or (n/6 is not a power of 2 and the largest power of 2 dividing n/6 is an odd power))
a(n) = 3 otherwise
CROSSREFS
Sequence in context: A293209 A318753 A318757 * A263754 A328800 A328802
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 06:41 EDT 2024. Contains 371964 sequences. (Running on oeis4.)