%I #18 Jun 29 2022 15:45:43

%S 0,1,3,3,6,7,7,7,12,13,15,15,14,15,15,15,24,25,27,27,30,31,31,31,28,

%T 29,31,31,30,31,31,31,48,49,51,51,54,55,55,55,60,61,63,63,62,63,63,63,

%U 56,57,59,59,62,63,63,63,60,61,63,63,62,63,63,63,96,97,99,99,102,103,103,103,108,109,111,111,110,111

%N a(n) = n OR floor(n/2), where OR is bitwise-OR (A003986).

%C Fibbinary numbers (A003714) give all integers n >= 0 for which a(n) = A003188(n) and also for which a(n) = A032766(n).

%H Antti Karttunen, <a href="/A269170/b269170.txt">Table of n, a(n) for n = 0..8191</a>

%F a(n) = A003986(n,(n-A000035(n))/2).

%F Other identities and observations. For all n >= 0:

%F a(2n) = A163617(n).

%F A003188(n) <= a(n) <= A032766(n).

%o (Scheme)

%o (define (A269170 n) (A003986bi n (/ (- n (A000035 n)) 2))) ;; Here A003986bi implements dyadic bitwise-OR operation (see A003986).

%o (PARI) a(n) = bitor(n, n\2); \\ _Michel Marcus_, Feb 29 2016

%o (Python)

%o def A269170(n): return n| n>>1 # _Chai Wah Wu_, Jun 29 2022

%Y Cf. A000035, A003714, A003986.

%Y Cf. A163617 (even bisection).

%Y Cf. also A003188, A048735, A032766.

%K nonn,base

%O 0,3

%A _Antti Karttunen_, Feb 22 2016