login
A330959
For any n >= 0: consider all pairs of numbers (x, y) whose binary representations can be interleaved (or shuffled) to produce the binary representation of n (possibly with leading zeros); a(n) is the least possible value of x XOR y (where XOR denotes the bitwise XOR operator).
2
0, 1, 1, 0, 1, 0, 3, 2, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 3, 2, 1, 0, 4, 5, 5, 4, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 3, 2, 0, 1, 1, 0, 1, 0, 0, 1, 2, 3, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 3, 2, 0, 1, 1, 0, 1, 0, 0
OFFSET
0,7
EXAMPLE
For n = 5:
- the binary representation of 5 is "101",
- the possible values for (x, y), restricted to x >= y without loss of generality, are:
bin(5) x y x XOR y
------- - - -------
"101" 5 0 5
"1/01" 1 1 0
"10/1" 2 1 3
"1/0/1" 3 0 3
- hence a(5) = 0.
PROG
(C) See Links section.
CROSSREFS
See A330925 for similar sequences.
Cf. A327187.
Sequence in context: A267883 A333437 A058257 * A083199 A327187 A274537
KEYWORD
nonn,base
AUTHOR
Rémy Sigrist, Jan 04 2020
STATUS
approved