A266756 - OEIS

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A266756

Nim value of subtraction game S(2,5,7) with a heap of n beans.

0, 0, 1, 1, 0, 2, 1, 3, 2, 2, 0, 3, 1, 0, 0, 1, 1, 2, 2, 3, 3, 2, 0, 0, 1, 1, 0, 2, 1, 3, 2, 2, 0, 3, 1, 0, 0, 1, 1, 2, 2, 3, 3, 2, 0, 0, 1, 1, 0, 2, 1, 3, 2, 2, 0, 3, 1, 0, 0, 1, 1, 2, 2, 3, 3, 2, 0, 0, 1, 1, 0, 2, 1, 3, 2, 2, 0, 3, 1, 0, 0, 1, 1, 2, 2, 3, 3, 2, 0, 0, 1, 1, 0, 2, 1, 3, 2, 2, 0, 3, 1, 0, 0, 1, 1, 2, 2, 3, 3, 2, 0, 0, 1, 1, 0, 2, 1, 3, 2, 2, 0, 3, 1, 0, 0, 1, 1, 2, 2, 3, 3, 2

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,6

COMMENTS

Periodic with period-length 22: repeat {0, 0, 1, 1, 0, 2, 1, 3, 2, 2, 0, 3, 1, 0, 0, 1, 1, 2, 2, 3, 3, 2}.

REFERENCES

R. K. Guy, Fair Game: How to play impartial combinatorial games, COMAP's Mathematical Exploration Series, 1989; see p. 38.

LINKS

Table of n, a(n) for n=0..131.

MATHEMATICA

PadRight[{}, 120, {0, 0, 1, 1, 0, 2, 1, 3, 2, 2, 0, 3, 1, 0, 0, 1, 1, 2, 2, 3, 3, 2}] (* Vincenzo Librandi, Jan 11 2016 *)

PROG

(Magma) &cat[[0, 0, 1, 1, 0, 2, 1, 3, 2, 2, 0, 3, 1, 0, 0, 1, 1, 2, 2, 3, 3, 2]^^5]; // Vincenzo Librandi, Jan 11 2016

CROSSREFS

Sequence in context: A141675 A248809 A021473 * A035181 A035151 A290536

Adjacent sequences: A266753 A266754 A266755 * A266757 A266758 A266759

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane, Jan 03 2016

STATUS

approved