login
This site is supported by donations to The OEIS Foundation.

 

Logo


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). 0
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(log2(n))+2), (see A000523).

LINKS

Table of n, a(n) for n=1..64.

CROSSREFS

Cf. A007088.

Sequence in context: A129280 A103224 A198346 * A054785 A236924 A266575

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 26 17:42 EDT 2019. Contains 323597 sequences. (Running on oeis4.)