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
%I A019591
%S A019591 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,
%T A019591 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,
%U A019591 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
%N A019591 Grundy function of game in which each player has to divide precisely 
               one set of coins into two subsets of different sizes.
%Y A019591 Sequence in context: A145580 A144219 A144027 this_sequence A091967 A031135 
               A037181
%Y A019591 Adjacent sequences: A019588 A019589 A019590 this_sequence A019592 A019593 
               A019594
%K A019591 nonn
%O A019591 1,5
%A A019591 micheluc(AT)maia.emse.fr (Dominique MICHELUCCI)

    
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 December 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research