login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A016741 Initial pile sizes which guarantee a win for player 2 in a certain variant of NIM. 3

%I

%S 2,3,5,6,7,8,11,13,18,19,22,26,30,43,70,71,76,84,140,153,223,224,392,

%T 394,405,681,689,696,1149,1164,1747,1759,1760,2893,2894,2895,4773,

%U 7316,7322,7324,12418,12420,12431,19052,19054,19067

%N Initial pile sizes which guarantee a win for player 2 in a certain variant of NIM.

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

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

%C Sequence gives set of initial pile sizes which guarantee a win for B.

%K nonn

%O 1,1

%A John Lame (jlame(AT)imagecafe.com)

%E More terms from _Sean A. Irvine_, Jan 19 2019

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 6 08:58 EDT 2021. Contains 343580 sequences. (Running on oeis4.)