id:A078750 - OEIS Search Results

Search: id:A078750

Displaying 1-1 of 1 results found.

page 1

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

+0
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; listen)

	OFFSET	`1,1`
	COMMENT	`No carry when adding a(n) to n in binary representation; 2*n <= a(n) <= 2^(floor(log2(n))+2), (see A000523).`
	CROSSREFS	`Cf. A007088.` `Sequence in context: A162794 A129280 A103224 this_sequence A054785 A123263 A008218` `Adjacent sequences: A078747 A078748 A078749 this_sequence A078751 A078752 A078753`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Dec 22 2002`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research