id:A053398 - OEIS Search Results

Search: id:A053398

Displaying 1-1 of 1 results found.

page 1

Nim-values from game of Kopper's Nim.

+0
11

0, 1, 1, 0, 1, 0, 2, 2, 2, 2, 0, 2, 0, 2, 0, 1, 1, 2, 2, 1, 1, 0, 1, 0, 2, 0, 1, 0, 3, 3, 3, 3, 3, 3, 3, 3, 0, 3, 0, 3, 0, 3, 0, 3, 0, 1, 1, 3, 3, 1, 1, 3, 3, 1, 1, 0, 1, 0, 3, 0, 1, 0, 3, 0, 1, 0, 2, 2, 2, 2, 3, 3, 3, 3, 2, 2, 2, 2, 0, 2, 0, 2, 0, 3, 0, 3, 0, 2, 0, 2, 0, 1, 1, 2, 2, 1, 1, 3, 3, 1, 1, 2, 2, 1, 1 (list; table; graph; listen)

	OFFSET	`1,7`
	COMMENT	`Rows/columns 1-10 are A007814, A050603, A053399, A053384-A053890.` `Comment from R. K. Guy: David Singmaster (zingmast(AT)sbu.ac.uk) sent me, about 5 years ago, a game he'd received from Bodo Koppers. It is played with two heaps of beans. The move is to remove one heap and split the other into two nonempty heaps. I'm not sure if Koppers invented it, or got it from elsewhere. I do not think that he analyzed it, but Singmaster did.`
	FORMULA	`a(x, y) = place of last zero bit of (a-1) OR (b-1).`
	CROSSREFS	`Sequence in context: A037867 A122879 A037866 this_sequence A065833 A097033 A113306` `Adjacent sequences: A053395 A053396 A053397 this_sequence A053399 A053400 A053401`
	KEYWORD	`nonn,tabl,easy,nice`
	AUTHOR	`David W. Wilson (davidwwilson(AT)comcast.net)`

page 1

Search completed in 0.007 seconds

Last modified November 25 08:46 EST 2009. Contains 167481 sequences.

AT&T Labs Research