More terms from _David Wasserman (wasserma(AT)spawar.navy.mil), _, Jan 24 2002

a(n) = smallest number not equal to a(i) for some i representing a 1-bit in the binary expansion of n (lsb least significant bit is 0th bit)

nonn,new

nonn

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

a(n) = the smallest number not equal to a(i) for some i representing a 1-bit in the binary expansion of n (lsb is 0th bit)

nonn,more,new

nonn

Joseph Shipman (shipman@(AT)savera.com)

More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Jan 24 2002

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, 0, 2, 2, 2, 0, 3

0,4

a(n) = the smallest number not equal to a(i) for some i representing a 1-bit in the binary expansion of n (lsb is 0th bit)

See A034797 for more information.

nonn,more

Joseph Shipman ([email protected])

approved