%I #13 Oct 13 2015 05:36:03
%S 10110000,10111100,11010000,11110010,11110100,100110110,1000001100,
%T 1001110100,1010010000,1011100000,1011110010,1100011010,1101000000,
%U 1101011110,1101100010,1101100100,1101110000,1110100100,1110110000,1111100010,1111101000,10010011100,10011011000,10100011100,10100011110
%N Even numbers that are not the sum of two binary palindromes (written in base 2).
%C This is A261678 written in base 2.
%C It would be nice to have an independent characterization of these binary strings.
%C Binary palindromes are odd, so no odd number is the sum of two of them.
%H N. J. A. Sloane, <a href="/A262556/b262556.txt">Table of n, a(n) for n = 1..10000</a>
%Y Cf. A261678, A241491.
%Y See also A006995 and A057148 (binary palindromes).
%K nonn,base
%O 1,1
%A _N. J. A. Sloane_, Oct 12 2015