login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A054736 Smallest losing position after your opponent has taken k stones in a variation of "Fibonacci Nim". 0
4, 8, 11, 15, 21, 29, 40, 55, 76 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

In Fibonacci Nim, the first player takes any number of stones (except all) and then each player takes no more than twice the number taken in the previous move. This sequence concerns the game where 2 is replaced by 3.

REFERENCES

R. K. Guy, Fair Game: How to play impartial combinatorial games, COMAP's Mathematical Exploration Series, 1989; see p. 22.

LINKS

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

EXAMPLE

If your opponent has just removed 1 or 2 stones from the pile leaving you with 8, then you lose. Any fewer stones after your opponent has taken 2 will be a win for you.

CROSSREFS

Sequence in context: A186926 A311056 A311057 * A024626 A311058 A311059

Adjacent sequences:  A054733 A054734 A054735 * A054737 A054738 A054739

KEYWORD

nonn,more

AUTHOR

Ken Levasseur, Apr 22 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 December 11 21:21 EST 2019. Contains 329937 sequences. (Running on oeis4.)