This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A006021 The game of contours. (Formerly M0409) 0

%I M0409

%S 0,1,2,3,1,4,3,2,0,5,2,3,1,4,3,2,0,5,2,3,1,4,3,2,0,5,2,3,1,4,3,2,0,5,

%T 2,3,1,4,3,2,0,5,2,3,1,4,3,2,0,5,2,3,1,4,3,2,0,5,2,3,1,4,3,2,0,5,2,3,

%U 1,4,3,2,0,5,2,3,1,4,3,2,0,5,2

%N The game of contours.

%D E. R. Berlekamp, J. H. Conway and R. K. Guy, Winning Ways, Academic Press, NY, 2 vols., 1982, see p. 553.

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%F a(0) = 0, b(1) = 0, a(n) = mex({a(s) ^ b(t): s+t = n-1 and s>0} union {b(s) + b(t): s+t = n-1}), b(n) = mex({a(s) ^ b(t): s+t = n-1 and s>0}) with ^ denoting bitwise addition. - _Sean A. Irvine_, Dec 14 2016

%F a(n+8) = a(n) for n >= 6. - _Sean A. Irvine_, Dec 14 2016

%K nonn

%O 0,3

%A _N. J. A. Sloane_.

%E More terms from _Sean A. Irvine_, Dec 14 2016

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 March 22 12:46 EDT 2019. Contains 321421 sequences. (Running on oeis4.)