id:A116361 - OEIS Search Results

Search: id:A116361

Displaying 1-1 of 1 results found.

page 1

Smallest k such that n XOR n*2^k = n*(2^k + 1).

+0
7

0, 1, 1, 2, 1, 1, 2, 3, 1, 1, 1, 4, 2, 4, 3, 4, 1, 1, 1, 2, 1, 1, 4, 5, 2, 2, 4, 5, 3, 5, 4, 5, 1, 1, 1, 2, 1, 1, 2, 6, 1, 1, 1, 6, 4, 4, 5, 6, 2, 2, 2, 2, 4, 6, 5, 6, 3, 6, 5, 6, 4, 6, 5, 6, 1, 1, 1, 2, 1, 1, 2, 3, 1, 1, 1, 4, 2, 5, 6, 7, 1, 1, 1, 7, 1, 1, 6, 7, 4, 5, 4, 7, 5, 5, 6, 7, 2, 2, 2, 2, 2, 7, 2, 7, 4 (list; graph; listen)

	OFFSET	`1,4`
	COMMENT	`a(A003714(n)) <= 1;` `a(A048716(n)) <= 2;` `a(A115845(n)) <= 3;` `a(A115847(n)) <= 4;` `a(A114086(n)) <= 5;` `a(A116362(n)) = n and a(m) < n for m < A116362(n).`
	CROSSREFS	`Sequence in context: A161161 A136277 A133233 this_sequence A106796 A082850 A088198` `Adjacent sequences: A116358 A116359 A116360 this_sequence A116362 A116363 A116364`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Feb 04 2006`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research