The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A241987 The number of P-positions in the Consecutive game with at most three piles, allowing for piles of zero, that are born in generation n. 2
 1, 5, 9, 13, 13, 23, 29, 29, 29, 39, 39, 47, 61, 57, 51, 63, 73, 79, 81, 79, 83, 93, 87, 87, 105, 97, 95, 123, 121, 137, 129, 111, 125, 145, 131, 159, 153, 171, 161, 173 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS In the Consecutive game, there are several piles of counters. A player is allowed to take the same positive number of counters from any subset of consecutive piles or any positive number of counters from one pile. The player who cannot move loses. a(n) is always odd. LINKS T. Khovanova and J. Xiong, Cookie Monster Plays Games, arXiv:1407.1533 [math.HO], 2014. EXAMPLE For n = 1 the a(1) = 5 P-positions are (1,0,1), (0,1,2), (0,2,1), (1,2,0), and (2,1,0). CROSSREFS Cf. A241988 (first differences), A237711 (Nim), A241983 (Cookie Monster Game), A241985 (At-Most-2-Jars Game). Sequence in context: A079357 A080455 A122798 * A189464 A130333 A304868 Adjacent sequences:  A241984 A241985 A241986 * A241988 A241989 A241990 KEYWORD nonn AUTHOR Tanya Khovanova and Joshua Xiong, Aug 10 2014 STATUS approved

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 November 30 05:12 EST 2021. Contains 349419 sequences. (Running on oeis4.)