id:A119346 - OEIS Search Results

Search: id:A119346

Displaying 1-1 of 1 results found.

page 1

A119346

Sequence of nim-values for the game in which two players alternately cut off one inch or root two inches from a piece of string of length n. Player who runs out of string loses.

+0
1

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

	OFFSET	`0,3`
	FORMULA	`To get the answers, add one to sequence A003151 and then start counting from zero, but return to zero whenever you reach a member of A003151 plus one.`
	CROSSREFS	`Adjacent sequences: A119343 A119344 A119345 this_sequence A119347 A119348 A119349` `Sequence in context: A091830 A029427 A132343 this_sequence A014586 A122924 A133450`
	KEYWORD	`nonn`
	AUTHOR	`njas, based on email from R. K. Guy and Alex Fink, Aug 05 2006`

page 1

Search completed in 0.002 seconds

Last modified October 10 20:39 EDT 2008. Contains 144831 sequences.

AT&T Labs Research