A330958

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 OR y (where OR denotes the bitwise OR operator).

0, 1, 1, 1, 1, 1, 3, 3, 1, 1, 2, 3, 2, 3, 3, 3, 1, 1, 2, 3, 2, 3, 3, 3, 3, 3, 3, 3, 6, 7, 7, 7, 1, 1, 2, 3, 2, 3, 3, 3, 3, 3, 3, 3, 5, 5, 7, 7, 3, 3, 3, 3, 5, 5, 6, 7, 6, 7, 6, 7, 6, 7, 7, 7, 1, 1, 2, 3, 2, 3, 3, 3, 3, 3, 3, 3, 5, 5, 7, 7, 3, 3, 3, 3, 5, 5, 6

(list; graph; refs; listen; history; text; internal format)

OFFSET

LINKS

EXAMPLE

PROG

CROSSREFS

KEYWORD

AUTHOR

STATUS