%I #14 Sep 25 2024 20:52:33
%S 0,1,2,4,8,16,17,29,32,33,34,57,58,64,65,66,68,93,114,116,128,129,130,
%T 132,136,185,186,228,232,256,257,258,260,264,272,273,349,370,372,456,
%U 464,465,512,513,514,516,520,528,529,541,544,545,546,697,698,740,744
%N Integers k such that 2*k XOR 9*k = 11*k.
%C XOR is A003987.
%C Integers k such that binomial(11*k,2*k) is odd. - _Robert Israel_, Jun 20 2018
%H Robert Israel, <a href="/A115795/b115795.txt">Table of n, a(n) for n = 1..10000</a>
%H <a href="/index/Con#CongruXOR">Index entries for sequences defined by congruent products under XOR</a>
%p select(n -> Bits:-And(2*n,9*n)=0, [$0..1000]); # _Robert Israel_, Jun 20 2018
%t Select[Range[0,750],BitXor[2#,9#]==11#&] (* _Harvey P. Dale_, Aug 06 2018 *)
%o (PARI) is(n)=bitxor(2*n, 9*n)==11*n \\ _Charles R Greathouse IV_, Sep 25 2024
%Y Cf. A115796 shows this sequence in binary.
%K nonn
%O 1,3
%A _Antti Karttunen_, Feb 01 2006