The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A006021 The game of contours.
(Formerly M0409)
0
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, 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, 1, 4, 3, 2, 0, 5, 2, 3, 1, 4, 3, 2, 0, 5, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
REFERENCES
E. R. Berlekamp, J. H. Conway and R. K. Guy, Winning Ways, Academic Press, NY, 2 vols., 1982, see p. 553.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
FORMULA
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
a(n+8) = a(n) for n >= 6. - Sean A. Irvine, Dec 14 2016
CROSSREFS
Sequence in context: A011857 A242360 A299927 * A002186 A125936 A243614
KEYWORD
nonn
AUTHOR
EXTENSIONS
More terms from Sean A. Irvine, Dec 14 2016
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 May 17 23:39 EDT 2024. Contains 372608 sequences. (Running on oeis4.)