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.

A195065 Numbers n such that BCR(n) is greater than n, where BCR = binary-complement-and-reverse = A036044.

This page as a plain text file.
%I A195065 #13 Jun 15 2021 02:01:38
%S A195065 0,4,8,16,18,20,24,32,34,36,40,44,48,64,66,68,70,72,74,76,80,82,84,88,
%T A195065 92,96,100,104,112,128,130,132,134,136,138,140,144,146,148,152,154,
%U A195065 156,160,162,164,168,172,176,180,184,188,192,196,200,208,216,224
%N A195065 Numbers n such that BCR(n) is greater than n, where BCR = binary-complement-and-reverse = A036044.
%C A195065 A035928(a(n)) > n.
%H A195065 Reinhard Zumkeller, <a href="/A195065/b195065.txt">Table of n, a(n) for n = 1..10000</a>
%o A195065 (Haskell)
%o A195065 a195065 n = a195065_list !! (n-1)
%o A195065 a195065_list = filter (\x -> a036044 x > x) [0,2..]
%o A195065 (Python)
%o A195065 def comp(s): z, o = ord('0'), ord('1'); return s.translate({z:o, o:z})
%o A195065 def BCR(n): return int(comp(bin(n)[2:])[::-1], 2)
%o A195065 def aupto(limit): return [m for m in range(limit+1) if BCR(m) > m]
%o A195065 print(aupto(224)) # _Michael S. Branicky_, Jun 14 2021
%Y A195065 Complement of A195064; subsequence of A195066.
%Y A195065 Cf. A035928, A036044, A195063.
%K A195065 nonn,base
%O A195065 1,2
%A A195065 _Reinhard Zumkeller_, Sep 16 2011