This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A262556 #13 Oct 13 2015 05:36:03 %S A262556 10110000,10111100,11010000,11110010,11110100,100110110,1000001100, %T A262556 1001110100,1010010000,1011100000,1011110010,1100011010,1101000000, %U A262556 1101011110,1101100010,1101100100,1101110000,1110100100,1110110000,1111100010,1111101000,10010011100,10011011000,10100011100,10100011110 %N A262556 Even numbers that are not the sum of two binary palindromes (written in base 2). %C A262556 This is A261678 written in base 2. %C A262556 It would be nice to have an independent characterization of these binary strings. %C A262556 Binary palindromes are odd, so no odd number is the sum of two of them. %H A262556 N. J. A. Sloane, <a href="/A262556/b262556.txt">Table of n, a(n) for n = 1..10000</a> %Y A262556 Cf. A261678, A241491. %Y A262556 See also A006995 and A057148 (binary palindromes). %K A262556 nonn,base %O A262556 1,1 %A A262556 _N. J. A. Sloane_, Oct 12 2015