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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A019591 Grundy function of game in which each player has to divide precisely one set of coins into two subsets of different sizes. 0
0, 0, 1, 0, 2, 1, 0, 2, 3, 0, 1, 4, 0, 2, 4, 0, 2, 3, 0, 1, 4, 0, 2, 4, 0, 2, 6, 0, 1, 3, 0, 2, 5, 0, 2, 6, 0, 1, 8, 0, 2, 3, 0, 2, 6, 0, 1, 4, 0, 2, 4, 0, 2, 3, 0, 1, 4, 0, 2, 8, 0, 2, 8, 0, 1, 3, 0, 2, 5, 0, 2, 7, 0, 1, 8, 0, 2, 3, 0, 2, 8, 0, 1, 4, 0, 2, 4, 0, 2, 3, 0, 1, 4, 0, 2, 8, 0, 2, 6 (list; graph; refs; listen; history; internal format)
OFFSET

1,5

CROSSREFS

Sequence in context: A145580 A144219 A144027 * A091967 A031135 A037181

Adjacent sequences:  A019588 A019589 A019590 * A019592 A019593 A019594

KEYWORD

nonn

AUTHOR

micheluc(AT)maia.emse.fr (Dominique MICHELUCCI)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 07:39 EST 2012. Contains 205881 sequences.