A034798 - OEIS

This site is supported by donations to The OEIS Foundation.

A034798

Value of n considered as a game.

0, 1, 0, 2, 1, 1, 2, 2, 0, 1, 0, 3, 1, 1, 3, 3, 0, 2, 0, 2, 2, 2, 2, 2, 0, 3, 0, 3, 3, 3, 3, 3, 0, 2, 0, 2, 2, 2, 2, 2, 0, 3, 0, 3, 3, 3, 3, 3, 0, 2, 0, 2, 2, 2, 2, 2, 0, 3, 0, 3, 3, 3, 3, 3, 0, 1, 0, 3, 1, 1, 3, 3, 0, 1, 0, 3, 1, 1, 3, 3, 0, 3, 0, 3, 3, 3, 3, 3, 0, 3, 0, 3, 3, 3, 3, 3, 0, 3, 0, 3 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,4`
	FORMULA	`a(n) = smallest number not equal to a(i) for some i representing a 1-bit in the binary expansion of n (least significant bit is 0th bit)`
	CROSSREFS	`See A034797 for more information.` `Sequence in context: A103899 A093324 A169676 * A171531 A171532 A171533` `Adjacent sequences: A034795 A034796 A034797 * A034799 A034800 A034801`
	KEYWORD	`nonn`
	AUTHOR	`Joseph Shipman (shipman(AT)savera.com)`
	EXTENSIONS	`More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Jan 24 2002`

Content is available under The OEIS End-User License Agreement .

Last modified February 16 06:46 EST 2012. Contains 205867 sequences.