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!)
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
2, 3, 4, 5, 6, 9, 10, 15, 16, 24, 25, 38, 39, 59, 60, 90, 91, 137, 138, 207, 208, 312, 313, 470, 471, 707, 708, 1062, 1063, 1595, 1596, 2394, 2395, 3593, 3594, 5391, 5392, 8088, 8089, 12134, 12135, 18203, 18204, 27306, 27307 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..45.

Tal Kubo, Generalized Fibonacci Nim

EXAMPLE

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

CROSSREFS

Cf. A016741.

Sequence in context: A217348 A319450 A153013 * A162228 A085714 A240093

Adjacent sequences:  A052489 A052490 A052491 * A052493 A052494 A052495

KEYWORD

nonn

AUTHOR

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

STATUS

approved

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 July 14 16:21 EDT 2020. Contains 335729 sequences. (Running on oeis4.)