cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

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.

Original entry on oeis.org

1, 6, 15, 28, 41, 64, 93, 122, 151, 190, 229, 276, 337, 394, 445, 508, 581, 660, 741, 820, 903, 996, 1083, 1170, 1275, 1372, 1467, 1590, 1711, 1848, 1977, 2088, 2213, 2358, 2489, 2648, 2801, 2972, 3133, 3306
Offset: 0

Views

Author

Tanya Khovanova and Joshua Xiong, Aug 10 2014

Keywords

Comments

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.

Examples

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

Links

Crossrefs

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

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.

Original entry on oeis.org

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
Offset: 0

Views

Author

Tanya Khovanova and Joshua Xiong, Aug 10 2014

Keywords

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.

Examples

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

Links

Crossrefs

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

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.

Original entry on oeis.org

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

Views

Author

Tanya Khovanova and Joshua Xiong, Aug 10 2014

Keywords

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.

Examples

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

Links

Crossrefs

Cf. A241986 (first differences), A237711 (Nim), A241983 (Cookie Monster Game), A241987 (Consecutive Game).
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.