|
Search: id:A137910
|
|
|
| A137910 |
|
The game "n-Chicken" is played with a pile of n sticks. Player I may remove 1 or two sticks from the pile. Thereafter players may remove as many sticks as the opposing player removed, or one more stick than the opposing player removed or one fewer (but at least one stick). The first player without a legal move is the loser. The sequence of numbers consists of all n such that player II has a winning strategy for n-chicken. |
|
+0
1
|
|
| 3, 5, 8, 11, 13, 16, 19, 21, 24, 26, 29, 31, 34, 37, 39, 42, 45, 47, 50, 52, 55, 57, 60, 63, 65, 68, 71, 73, 76, 78, 81, 83, 86, 88, 91, 94, 96, 99, 101, 104, 106, 109, 112, 114, 117, 120, 122, 125, 128, 130, 133, 136, 138, 141, 144, 146, 149, 151
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
James Henle and Emma Schlatter, Python program
|
|
EXAMPLE
|
n=3 is a win for player II as follows: If player I takes 1 stick, II can take II sticks. Since there are no sticks left in the pile, player I has no legal move and loses. Similarly, if I takes 2 stick, II can take 1 stick.
Note that n=1 and n=2 are wins for player I who can take all the sticks in the pile in one move.
|
|
CROSSREFS
|
Sequence in context: A050098 A025512 A026274 this_sequence A022850 A008576 A047622
Adjacent sequences: A137907 A137908 A137909 this_sequence A137911 A137912 A137913
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
James Henle and Emma Schlatter (jhenle(AT)smith.edu and eschlatter(AT)email.smith.edu), Feb 22 2008
|
|
|
Search completed in 0.002 seconds
|
