Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A016741
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A016741 Initial pile sizes which guarantee a win for player 2 in a certain variant of NIM. +0
3
2, 3, 5, 6, 7, 8, 11, 13, 18, 19, 22, 26, 30, 43, 70, 71, 76, 84, 140, 153, 223, 224, 392, 394, 405, 681, 689, 696, 1149, 1164, 1747, 1759, 1760, 2893, 2894, 2895, 4773 (list; graph; listen)
OFFSET

1,1

COMMENT

Play starts with a single pile of N > 1 stones. Two players A and B take turns removing stones from the pile.

Player A must remove at least one stone and may remove any number of stones < N on turn A1. On subsequent turns, each player must remove at least one stone and may remove any number of

stones not exceeding twice the number of stones removed by their opponent on the previous turn. No player may remove the same number of stones

on consecutive turns if there are at least two stones remaining in the pile. Sequence gives set of initial pile sizes which guarantee a win for B.

CROSSREFS

Adjacent sequences: A016738 A016739 A016740 this_sequence A016742 A016743 A016744

Sequence in context: A063966 A123030 A063752 this_sequence A006431 A151894 A028229

KEYWORD

nonn

AUTHOR

John Lame (jlame(AT)imagecafe.com)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 8 20:39 EST 2009. Contains 166234 sequences.


AT&T Labs Research