Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A019591
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A019591 Grundy function of game in which each player has to divide precisely one set of coins into two subsets of different sizes. +0
1
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; listen)
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 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research