cp's OEIS Frontend

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.

A273245 Non-palindromic binary numbers whose reversal is a palindrome.

This page as a plain text file.
%I A273245 #34 May 21 2016 13:38:39
%S A273245 10,100,110,1000,1010,1100,1110,10000,10010,10100,11000,11100,11110,
%T A273245 100000,100010,100100,101000,101010,110000,110110,111000,111100,
%U A273245 111110,1000000,1000010,1000100,1001000,1010000,1010100,1011010,1100000,1100110,1101100,1110000,1111000,1111100
%N A273245 Non-palindromic binary numbers whose reversal is a palindrome.
%H A273245 Chai Wah Wu, <a href="/A273245/b273245.txt">Table of n, a(n) for n = 1..10000</a>
%F A273245 Consists of binary palindromes (A006995) times nontrivial powers of 2, that is, 2^i, i>0. - _N. J. A. Sloane_, May 19 2016
%F A273245 a(n) = A007088(A272670(n)). - _R. J. Mathar_, May 20 2016
%p A273245 # see A272670 for the other subroutines
%p A273245 for n from 1 to 400 do
%p A273245     if isA272670(n) then
%p A273245         printf("%d,",A007088(n)) ;
%p A273245     end if;
%p A273245 end do: # _R. J. Mathar_, May 20 2016
%o A273245 (Python)
%o A273245 A273245_list = [int(m) for m in (bin(n)[2:] for n in range(1,10**4)) if m != m[::-1] and m.rstrip('0') == m[::-1].lstrip('0')] # _Chai Wah Wu_, May 21 2016
%Y A273245 Cf. A006995, A273329, A272670 (this sequence written in base 10), A057890 (and divided by 2).
%K A273245 nonn,easy,base
%O A273245 1,1
%A A273245 _Giovanni Teofilatto_, May 18 2016