The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A241988 The number of P-positions in the Consecutive game with at most three piles, allowing for piles of zero, that are born by generation n. 3

%I #13 Oct 06 2014 23:02:43

%S 1,6,15,28,41,64,93,122,151,190,229,276,337,394,445,508,581,660,741,

%T 820,903,996,1083,1170,1275,1372,1467,1590,1711,1848,1977,2088,2213,

%U 2358,2489,2648,2801,2972,3133,3306

%N The number of P-positions in the Consecutive game with at most three piles, allowing for piles of zero, that are born by generation n.

%C 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.

%H T. Khovanova and J. Xiong, <a href="http://arxiv.org/abs/1407.1533">Cookie Monster Plays Games</a>, arXiv:1407.1533 [math.HO], 2014.

%e For n = 1 the a(1) = 6 P-positions are (0,0,0), (1,0,1), (0,1,2), (0,2,1), (1,2,0), and (2,1,0).

%Y Cf. A241987 (partial sums), A237686 (Nim), A241984 (Cookie Monster Game), A241986 (At-Most-2-Jars Game).

%K nonn

%O 0,2

%A _Tanya Khovanova_ and _Joshua Xiong_, Aug 10 2014

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 23 01:37 EDT 2024. Contains 372758 sequences. (Running on oeis4.)