login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A241984 The number of P-positions in the Cookie Monster game with at most three piles, allowing for piles of zero, that are born by generation n. 2
1, 7, 19, 37, 55, 82, 127, 166, 232, 316, 385, 463, 547, 634, 706, 805, 922, 1036, 1165, 1294, 1429, 1597, 1735, 1888, 2041, 2203, 2395, 2596, 2749, 2911, 3133, 3337, 3559, 3772, 4009, 4261, 4489, 4723, 4987, 5242 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

In the Cookie Monster game, there are several piles of counters. A player is allowed to take the same positive number of counters from any nonempty subset of the piles. The player who cannot move loses.

LINKS

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

T. Khovanova and J. Xiong, Cookie Monster Plays Games, arXiv:1407.1533 [math.HO], 2014.

EXAMPLE

For n = 1 the a(1) = 7 P-positions are (0,0,0) and (0,1,2), and permutations.

CROSSREFS

Cf. A241983 (partial sums), A237686 (Nim), A241986 (At-Most-2-Jars Game), A241988 (Consecutive Game).

Sequence in context: A215421 A192594 A031337 * A301717 A152540 A073859

Adjacent sequences:  A241981 A241982 A241983 * A241985 A241986 A241987

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 28 02:01 EDT 2020. Contains 337388 sequences. (Running on oeis4.)