%I A145800
%S A145800 1,5,3,9,5,27,7,17,9,21,27,51,27,93,15,33,17,73,51,165,21,45,93,99,51,
%T A145800 107,27,231,93,189,31,65,33,273,99,73,165,153,231,325,165,85,107,717,45,
%U A145800 93,189,195,99,403,51,843,107,219,119,455,231,471,119,633,189,381,63
%N A145800 a(n) = the smallest positive integer that is a (odd) palindrome when 
               represented in binary and that contains within it the binary representation 
               of n.
%C A145800 For n = power of 2, a(n) = 2*n + 1.
%C A145800 This sequence contains, by definition, those binary palindromes that 
               are odd, ie those palindromes without leading zeros. In other words, 
               only integers occurring in sequence A006995 occur in this sequence.
%C A145800 a(A006995(n)) = A006995(n). [From Ray Chandler (rayjchandler(AT)sbcglobal.net), 
               Oct 26 2008]
%H A145800 Leroy Quet, <a href="http://www.prism-of-spirals.net/">Home Page</a> 
               (listed in lieu of email address)
%e A145800 6 in binary is 110. Those integers which contain 110 in their binary 
               representations are 6 (110 in binary), 12 (1100 in binary), 13 (1101 
               in binary), 14 (1110 in binary), 22 (10110 in binary), 24 (11000 
               in binary), 25 (11001 in binary), 26 (11010 in binary), 27 (11011 
               in binary), etc... Now, 27 (11011 in binary) is the smallest of these 
               integers that is a binary palindrome; so a(6) = 27.
%Y A145800 A006995, A145799
%Y A145800 Sequence in context: A128426 A165789 A133090 this_sequence A161501 A118273 
               A073891
%Y A145800 Adjacent sequences: A145797 A145798 A145799 this_sequence A145801 A145802 
               A145803
%K A145800 base,nonn
%O A145800 1,2
%A A145800 Leroy Quet Oct 19 2008
%E A145800 Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Oct 26 2008