The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A035928 Numbers n such that BCR(n) = n, where BCR = binary-complement-and-reverse = take one's complement then reverse bit order. 27

%I

%S 2,10,12,38,42,52,56,142,150,170,178,204,212,232,240,542,558,598,614,

%T 666,682,722,738,796,812,852,868,920,936,976,992,2110,2142,2222,2254,

%U 2358,2390,2470,2502,2618,2650,2730,2762,2866,2898,2978,3010,3132,3164,3244

%N Numbers n such that BCR(n) = n, where BCR = binary-complement-and-reverse = take one's complement then reverse bit order.

%C Numbers n such that A036044(n) = n.

%C Also: numbers such that n+BR(n) is in A000225={2^k-1} (with BR = binary reversed). - _M. F. Hasler_, Dec 17 2007

%H Reinhard Zumkeller, <a href="/A035928/b035928.txt">Table of n, a(n) for n = 1..10000</a>

%H Aayush Rajasekaran, Jeffrey Shallit, and Tim Smith, <a href="https://arxiv.org/abs/1706.10206">Sums of Palindromes: an Approach via Nested-Word Automata</a>, preprint arXiv:1706.10206 [cs.FL], June 30 2017.

%F If offset were 0, a(2n+1) - a(2n) = 2^floor(log_2(n)+1).

%e 38 is such a number because 38=100110; complement to get 011001, then reverse bit order to get 100110.

%p [seq(ReflectBinSeq(j,(floor_log_2(j)+1)),j=1..256)];

%p ReflectBinSeq := (x,n) -> (((2^n)*x)+binrevcompl(x));

%p binrevcompl := proc(nn) local n,z; n := nn; z := 0; while(n <> 0) do z := 2*z + ((n+1) mod 2); n := floor(n/2); od; RETURN(z); end;

%p floor_log_2 := proc(n) local nn,i: nn := n; for i from -1 to n do if(0 = nn) then RETURN(i); fi: nn := floor(nn/2); od: end; # Computes essentially the same as floor(log[2](n))

%p # alternative Maple program:

%p q:= n-> (l-> is(n=add((1-l[-i])*2^(i-1), i=1..nops(l))))(Bits[Split](n)):

%p select(q, [\$1..3333])[]; # _Alois P. Heinz_, Feb 10 2021

%t bcrQ[n_]:=Module[{idn2=IntegerDigits[n,2]},Reverse[idn2/.{1->0,0->1}] == idn2]; Select[Range[3200],bcrQ] (* _Harvey P. Dale_, May 24 2012 *)

%o (PARI) for(n=1,1000,l=length(binary(n)); b=binary(n); if(sum(i=1,l,abs(component(b,i)-component(b,l+1-i)))==l,print1(n,",")))

%o (PARI) for(i=0,999,if(Set(vecextract(t=binary(i),"-1..1")+t)==["1"],print1(i","))) \\ _M. F. Hasler_, Dec 17 2007

%o (PARI) a(n) = my (b=binary(n)); (n+1)*2^#b-fromdigits(Vecrev(b),2)-1 \\ _Rémy Sigrist_, Mar 15 2021

%o a035928 n = a035928_list !! (n-1)

%o a035928_list = filter (\x -> a036044 x == x) [0,2..]

%o -- _Reinhard Zumkeller_, Sep 16 2011

%o (Python)

%o def comp(s): z, o = ord('0'), ord('1'); return s.translate({z:o, o:z})

%o def BCR(n): return int(comp(bin(n)[2:])[::-1], 2)

%o def aupto(limit): return [m for m in range(limit+1) if BCR(m) == m]

%o print(aupto(3244)) # _Michael S. Branicky_, Feb 10 2021

%Y Cf. A061855.

%Y Cf. A000225.

%Y Intersection of A195064 and A195066; cf. A195063, A195065.

%K nonn,nice,easy,base

%O 1,1

%A Mike Keith (domnei(AT)aol.com)

%E More terms from _Erich Friedman_

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 July 26 12:20 EDT 2021. Contains 346294 sequences. (Running on oeis4.)