login
This site is supported by donations to The OEIS Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A241985 The number of P-positions in the At-Most-2-Jars game with up to three piles, allowing for piles of zero, that are born in generation n. 2
1, 7, 13, 13, 25, 37, 37, 43, 37, 43, 55, 49, 73, 79, 79, 109, 97, 115, 85, 97, 97, 145, 121, 109, 163, 151, 151, 115, 121, 181, 175, 211, 193, 193, 211, 169, 211, 271, 187, 181 (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.

a(n) is always 1 greater than a multiple of 6.

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 (1,1,1) and permutations of (0,1,2).

CROSSREFS

Cf. A241986 (first differences), A237711 (Nim), A241983 (Cookie Monster Game), A241987 (Consecutive Game).

Sequence in context: A090229 A259222 A204713 * A194408 A057930 A233593

Adjacent sequences:  A241982 A241983 A241984 * A241986 A241987 A241988

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 January 15 19:06 EST 2019. Contains 319171 sequences. (Running on oeis4.)