id:A019591 - OEIS Search Results

Search: id:A019591

Displaying 1-1 of 1 results found.

page 1

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)

	OFFSET	`1,5`
	CROSSREFS	`Sequence in context: A145580 A144219 A144027 this_sequence A091967 A031135 A037181` `Adjacent sequences: A019588 A019589 A019590 this_sequence A019592 A019593 A019594`
	KEYWORD	`nonn`
	AUTHOR	`micheluc(AT)maia.emse.fr (Dominique MICHELUCCI)`

page 1

Search completed in 0.002 seconds

Last modified December 7 23:50 EST 2009. Contains 170430 sequences.

AT&T Labs Research