login

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”).

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
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
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 A376298 A057930
KEYWORD
nonn
AUTHOR
Tanya Khovanova and Joshua Xiong, Aug 10 2014
STATUS
approved