%I #4 Mar 31 2012 13:20:43
%S 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,
%T 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,
%U 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
%N Value of n considered as a game.
%F 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)
%Y See A034797 for more information.
%K nonn
%O 0,4
%A Joseph Shipman (shipman(AT)savera.com)
%E More terms from _David Wasserman_, Jan 24 2002