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!)
A229764 Nim sequence of MARK: the game on n counters in which the legal moves are to remove 1 counter or to halve the number of counters and round down. 0

%I #32 Nov 02 2023 06:05:59

%S 0,1,0,2,1,2,0,1,0,2,0,1,2,1,0,2,1,2,0,1,2,1,0,2,0,1,0,2,1,2,0,1,0,2,

%T 0,1,2,1,0,2,0,1,0,2,1,2,0,1,2,1,0,2,1,2,0,1,0,2,0,1,2,1,0,2,1,2,0,1,

%U 2,1,0,2,0,1,0,2,1,2,0,1,2,1,0,2,1,2,0,1,0,2,0,1,2,1,0,2,0,1,0,2,1

%N Nim sequence of MARK: the game on n counters in which the legal moves are to remove 1 counter or to halve the number of counters and round down.

%C Is this a shifted version of A036578? - _R. J. Mathar_, Sep 30 2013 [Yes: see Thm. 4 in Fraenkel (2011). _Don Reble_, Nov 02 2023]

%H Aviezri S. Fraenkel, <a href="http://www.combinatorics.org/ojs/index.php/eljc/article/view/v18i2p19">Aperiodic Subtraction Games</a>, The Electronic Journal of Combinatorics, 18(2) (2011).

%H Eric Sopena, <a href="http://arxiv.org/abs/1509.04199">i-Mark: A new subtraction division game</a>, arXiv:1509.04199 [cs.DM], 2015.

%p a:=proc(n) local i:

%p option remember:

%p if n = 0 then

%p return 0:

%p else

%p for i from 0 while i in {a(n-1), a(floor(n/2))} do od:

%p return i:

%p fi:

%p end:

%t a[0]=0; a[n_] := a[n]=(i=0; While[i==a[n-1] || i==a[Floor[n/2]], i++]; i);

%t Table[a[n], {n, 0, 100}] (* _Jean-François Alcover_, Dec 06 2017, from Maple *)

%Y Positions of zeros after a(0) given by A036554.

%K nonn

%O 0,4

%A _Nathan Fox_, Sep 28 2013

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 19 19:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)