This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A116361 Smallest k such that n XOR n*2^k = n*(2^k + 1). 8
 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; refs; listen; history; text; internal format)
 OFFSET 0,4 COMMENTS 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). LINKS Charles R Greathouse IV, Table of n, a(n) for n = 0..10000 PROG (PARI) a(n)=my(k); while(bitxor(n, n<

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.

Last modified June 25 10:10 EDT 2019. Contains 324351 sequences. (Running on oeis4.)