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!)
A052492 Initial pile sizes that guarantee a win for player 2 in a variant of Fibonacci Nim where the players may not take one stone. 0

%I #6 Sep 03 2023 15:01:54

%S 2,3,4,5,6,9,10,15,16,24,25,38,39,59,60,90,91,137,138,207,208,312,313,

%T 470,471,707,708,1062,1063,1595,1596,2394,2395,3593,3594,5391,5392,

%U 8088,8089,12134,12135,18203,18204,27306,27307

%N Initial pile sizes that guarantee a win for player 2 in a variant of Fibonacci Nim where the players may not take one stone.

%H Tal Kubo, <a href="http://www.ics.uci.edu/~eppstein/cgt/fibnim.html">Generalized Fibonacci Nim</a>.

%e a(5)=6 because player 1 can't take 1 stone; if player 1 takes 2 stones or more, player 2 grabs the rest.

%Y Cf. A016741.

%K nonn

%O 1,1

%A Felix Goldberg (sgefelix(AT)t2.technion.ac.il), Mar 16 2000

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 April 23 01:19 EDT 2024. Contains 371906 sequences. (Running on oeis4.)