This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A262556 Even numbers that are not the sum of two binary palindromes (written in base 2). 2
 10110000, 10111100, 11010000, 11110010, 11110100, 100110110, 1000001100, 1001110100, 1010010000, 1011100000, 1011110010, 1100011010, 1101000000, 1101011110, 1101100010, 1101100100, 1101110000, 1110100100, 1110110000, 1111100010, 1111101000, 10010011100, 10011011000, 10100011100, 10100011110 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS This is A261678 written in base 2. It would be nice to have an independent characterization of these binary strings. Binary palindromes are odd, so no odd number is the sum of two of them. LINKS N. J. A. Sloane, Table of n, a(n) for n = 1..10000 CROSSREFS Cf. A261678, A241491. See also A006995 and A057148 (binary palindromes). Sequence in context: A017601 A186173 A043644 * A155514 A133595 A108810 Adjacent sequences:  A262553 A262554 A262555 * A262557 A262558 A262559 KEYWORD nonn,base AUTHOR N. J. A. Sloane, Oct 12 2015 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 20 06:26 EST 2019. Contains 320332 sequences. (Running on oeis4.)