login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
OFFSET
1,1
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 * A339454 A162228 A085714
KEYWORD
nonn
AUTHOR
Felix Goldberg (sgefelix(AT)t2.technion.ac.il), Mar 16 2000
STATUS
approved