|
%I #15 May 05 2023 12:31:51
%S 1,1,3,3,3,3,3,3,5,7,7,7,7,7,7,5,5,5,7,7,11,13,7,7,7,7,13,11,7,7,5,5,
%T 7,7,13,13,15,15,15,11,11,11,13,13,13,15,15,11,11,15,15,13,13,13,11,
%U 11,11,15,15,15,13,13,7,7,7,7,15,15,15,15,13,13,15,15,27,23,23,27,15,15,15,15,27,27,29,29,31,23,21,29,31,23,23,25,11,11,11,11,25
%N a(n) = A002487(n-1) OR A002487(n), where OR is bitwise-or (A003986).
%H Antti Karttunen, <a href="/A283986/b283986.txt">Table of n, a(n) for n = 1..8192</a>
%H <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%F a(n) = A002487(n-1) OR A002487(n), where OR is bitwise-or (A003986).
%F a(n) = A283987(n) + A283988(n).
%F a(n) = A007306(n) - A283988(n).
%F a(n) = A283976((2*n)-1).
%t a[0] = 0; a[1] = 1; a[n_] := If[EvenQ@ n, a[n/2], a[(n - 1)/2] + a[(n + 1)/2]]; Table[BitOr[a[n - 1], a@ n], {n, 120}] (* _Michael De Vlieger_, Mar 22 2017 *)
%o (Scheme) (define (A283986 n) (A003986bi (A002487 (- n 1)) (A002487 n))) ;; Where A003986bi implements bitwise-OR (A003986).
%o (PARI) A(n) = if(n<2, n, if(n%2, A(n\2) + A((n + 1)/2), A(n/2)));
%o for(n=1, 101, print1(bitor(A(n - 1), A(n))", ")) \\ _Indranil Ghosh_, Mar 23 2017
%o (Python)
%o from functools import reduce
%o def A283986(n): return sum(reduce(lambda x,y:(x[0],x[0]+x[1]) if int(y) else (x[0]+x[1],x[1]),bin(n)[-1:2:-1],(1,0)))|sum(reduce(lambda x,y:(x[0],x[0]+x[1]) if int(y) else (x[0]+x[1],x[1]),bin(n-1)[-1:2:-1],(1,0))) # _Chai Wah Wu_, May 05 2023
%Y Odd bisection of A283976.
%Y Cf. A002487, A003986, A283988.
%Y Cf. A283973 (positions where coincides with A007306, equally, with A283987).
%K nonn,base
%O 1,3
%A _Antti Karttunen_, Mar 21 2017
|
