|
%I #13 Jun 29 2021 11:20:40
%S 2,4,8,8,10,16,16,16,18,20,32,32,32,32,32,32,34,36,40,40,42,64,64,64,
%T 64,64,64,64,64,64,64,64,66,68,72,72,74,80,80,80,82,84,128,128,128,
%U 128,128,128,128,128,128,128,128,128,128,128,128,128,128,128,128,128,128,128
%N Least m not less than 2*n such that m + n = m OR n (logical 'or', bitwise).
%C No carry when adding a(n) to n in binary representation; 2*n <= a(n) <= 2^(floor(log_2(n))+2) (see A000523).
%H Michel Marcus, <a href="/A078750/b078750.txt">Table of n, a(n) for n = 1..8192</a>
%o (PARI) a(n) = my(m=2*n); while (bitor(m, n) != m+n, m++); m; \\ _Michel Marcus_, Jun 27 2021
%Y Cf. A000523, A007088.
%K nonn
%O 1,1
%A _Reinhard Zumkeller_, Dec 22 2002
|
