The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A078750 Least m not less than 2*n such that m + n = m OR n (logical 'or', bitwise). 1
 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 (list; graph; refs; listen; history; text; internal format)
 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified March 28 08:28 EDT 2023. Contains 361585 sequences. (Running on oeis4.)