id:A034798 - OEIS Search Results

Search: id:A034798

Displaying 1-1 of 1 results found.

page 1

Value of n considered as a game.

+0
4

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; listen)

	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: A060256 A103899 A093324 this_sequence A115236 A064286 A002471` `Adjacent sequences: A034795 A034796 A034797 this_sequence 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`

page 1

Search completed in 0.002 seconds

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.

AT&T Labs Research