The OEIS is supported by the many generous donors to the OEIS Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A327187 For any n >= 0: consider the different ways to split the binary representation of n into two (possibly empty) parts, say with value x and y; a(n) is the least possible value of x XOR y (where XOR denotes the bitwise XOR operator). 3

%I

%S 0,1,1,0,1,0,3,2,1,0,0,1,3,2,1,0,1,0,0,1,5,4,4,5,3,2,1,0,7,6,5,4,1,0,

%T 0,1,0,1,2,3,5,4,7,6,1,0,3,2,3,2,1,0,2,3,0,1,7,6,5,4,3,2,1,0,1,0,0,1,

%U 0,1,2,3,9,8,8,9,8,9,10,11,5,4,7,6,1,0

%N For any n >= 0: consider the different ways to split the binary representation of n into two (possibly empty) parts, say with value x and y; a(n) is the least possible value of x XOR y (where XOR denotes the bitwise XOR operator).

%H Rémy Sigrist, <a href="/A327187/b327187.txt">Table of n, a(n) for n = 0..8192</a>

%F a(n) = 0 iff n = 0 or n belongs to A175468.

%e For n=42:

%e - the binary representation of 42 is "101010",

%e - there are 7 ways to split it:

%e - "" and "101010": x=0 and y=42: 0 XOR 42 = 42,

%e - "1" and "01010": x=1 and y=10: 1 XOR 10 = 11,

%e - "10" and "1010": x=2 and y=10: 2 XOR 10 = 8,

%e - "101" and "010": x=5 and y=2: 5 XOR 2 = 7,

%e - "1010" and "10": x=10 and y=2: 10 XOR 2 = 8,

%e - "10101" and "0": x=21 and y=0: 21 XOR 0 = 21,

%e - "101010" and "": x=42 and y=0: 42 XOR 0 = 42,

%e - hence a(42) = 7.

%o (PARI) a(n) = my (v=oo, b=binary(n)); for (w=0, #b, v=min(v, bitxor(fromdigits(b[1..w],2), fromdigits(b[w+1..#b],2)))); v

%Y See A327186 for other variants.

%Y Cf. A175468.

%K nonn,look,base

%O 0,7

%A _Rémy Sigrist_, Aug 25 2019

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 January 21 12:13 EST 2022. Contains 350477 sequences. (Running on oeis4.)