cp's OEIS Frontend

A292600 a(n) = A006068(floor(n/2)); A006068 with every term duplicated, where A006068 is the inverse of binary gray code.

%I A292600 #17 Jun 30 2022 12:46:34
%S A292600 0,0,1,1,3,3,2,2,7,7,6,6,4,4,5,5,15,15,14,14,12,12,13,13,8,8,9,9,11,
%T A292600 11,10,10,31,31,30,30,28,28,29,29,24,24,25,25,27,27,26,26,16,16,17,17,
%U A292600 19,19,18,18,23,23,22,22,20,20,21,21,63,63,62,62,60,60,61,61,56,56,57,57,59,59,58,58,48,48,49,49,51,51
%N A292600 a(n) = A006068(floor(n/2)); A006068 with every term duplicated, where A006068 is the inverse of binary gray code.
%H A292600 Antti Karttunen, <a href="/A292600/b292600.txt">Table of n, a(n) for n = 0..16383</a>
%H A292600 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%F A292600 a(n) = A006068(A004526(n)) = A006068(floor(n/2)).
%t A292600 Table[If[n < 2, 0, BitXor @@ Table[Floor[#/2^m], {m, 0, Floor@ Log2@ #}] &@ Floor[n/2]], {n, 0, 85}] (* _Michael De Vlieger_, Sep 21 2017, after _Jean-François Alcover_ at A006068 *)
%o A292600 (Python)
%o A292600 def A292600(n):
%o A292600     k, m = n>>1, n>>2
%o A292600     while m > 0:
%o A292600         k ^= m
%o A292600         m >>= 1
%o A292600     return k # _Chai Wah Wu_, Jun 30 2022
%Y A292600 Cf. A004526, A006068, A193231, A292601.
%K A292600 nonn,base
%O A292600 0,5
%A A292600 _Antti Karttunen_, Sep 21 2017