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!)
 A241986 The number of P-positions in the At-Most-2-Jars game with at most three piles, allowing for piles of zero, that are born by generation n. 3
 1, 8, 21, 34, 59, 96, 133, 176, 213, 256, 311, 360, 433, 512, 591, 700, 797, 912, 997, 1094, 1191, 1336, 1457, 1566, 1729, 1880, 2031, 2146, 2267, 2448, 2623, 2834, 3027, 3220, 3431, 3600, 3811, 4082, 4269, 4450 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS In the At-Most-2-Jars game, there are several piles of counters. A player is allowed to take the same positive number of counters from any subset of two piles or any positive number of counters from one pile. The player who cannot move loses. LINKS T. Khovanova and J. Xiong, Cookie Monster Plays Games, arXiv:1407.1533 [math.HO], 2014. EXAMPLE For n = 1 the a(1) = 8 P-positions are (0,0,0), (1,1,1), and permutations of (0,1,2). CROSSREFS Cf. A241985 (partial sums), A237686 (Nim), A241984 (Cookie Monster Game), A241988 (Consecutive Game). Sequence in context: A090206 A139590 A154894 * A179681 A224039 A279895 Adjacent sequences:  A241983 A241984 A241985 * A241987 A241988 A241989 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 December 6 22:42 EST 2021. Contains 349567 sequences. (Running on oeis4.)