Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A052492
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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
1
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; listen)
OFFSET

1,1

LINKS

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: A018321 A082642 A153013 this_sequence A162228 A085714 A116546

Adjacent sequences: A052489 A052490 A052491 this_sequence A052493 A052494 A052495

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research