A078750 Least m not less than 2*n such that m + n = m OR n (logical 'or', bitwise).

2, 4, 8, 8, 10, 16, 16, 16, 18, 20, 32, 32, 32, 32, 32, 32, 34, 36, 40, 40, 42, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 66, 68, 72, 72, 74, 80, 80, 80, 82, 84, 128, 128, 128, 128, 128, 128, 128, 128, 128, 128, 128, 128, 128, 128, 128, 128, 128, 128, 128, 128, 128, 128

Offset

1,1

Comments

No carry when adding a(n) to n in binary representation; 2*n <= a(n) <= 2^(floor(log_2(n))+2) (see A000523).

Links

Michel Marcus, Table of n, a(n) for n = 1..8192

Prog

(PARI) a(n) = my(m=2*n); while (bitor(m, n) != m+n, m++); m; \\ Michel Marcus, Jun 27 2021

Crossrefs

Cf. A000523, A007088.

Sequence in context: A129280 A103224 A198346 * A360156 A054785 A236924

Adjacent sequences: A078747 A078748 A078749 * A078751 A078752 A078753

Keyword

nonn

Author

Reinhard Zumkeller, Dec 22 2002

Status

approved