login
a(n) = n - A292600(n).
3

%I #12 Jun 30 2022 12:45:51

%S 0,1,1,2,1,2,4,5,1,2,4,5,8,9,9,10,1,2,4,5,8,9,9,10,16,17,17,18,17,18,

%T 20,21,1,2,4,5,8,9,9,10,16,17,17,18,17,18,20,21,32,33,33,34,33,34,36,

%U 37,33,34,36,37,40,41,41,42,1,2,4,5,8,9,9,10,16,17,17,18,17,18,20,21,32,33,33,34,33,34,36,37,33,34,36,37,40,41,41,42,64,65,65

%N a(n) = n - A292600(n).

%H Antti Karttunen, <a href="/A292601/b292601.txt">Table of n, a(n) for n = 0..16383</a>

%H <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>

%F a(n) = n - A292600(n) = n - A006068(floor(n/2)).

%t Table[n - If[n < 2, 0, BitXor @@ Table[Floor[#/2^m], {m, 0, Floor@ Log2@ #}] &@ Floor[n/2]], {n, 0, 98}] (* _Michael De Vlieger_, Sep 21 2017 *)

%o (Python)

%o def A292601(n):

%o k, m = n>>1, n>>2

%o while m > 0:

%o k ^= m

%o m >>= 1

%o return n-k # _Chai Wah Wu_, Jun 30 2022

%Y Cf. A006068, A292600.

%K nonn,base

%O 0,4

%A _Antti Karttunen_, Sep 21 2017