A330961 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 abs(x - y).

0, 1, 1, 0, 1, 0, 1, 2, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 2, 1, 1, 0, 1, 2, 3, 4, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 2, 0, 1, 1, 0, 1, 0, 0, 1, 2, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 2, 0, 1, 1, 0, 1, 0, 0

Offset

0,8

Links

Table of n, a(n) for n=0..86.

Rémy Sigrist, C program for A330961

Index entries for sequences related to binary expansion of n

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-y|
  -------  -  -  -----
  "101"    5  0      5
  "1/01"   1  1      0
  "10/1"   2  1      1
  "1/0/1"  3  0      3
- hence a(5) = 0.

Prog

(C) See Links section.

Crossrefs

See A330925 for similar sequences.

Cf. A327191.

Sequence in context: A007920 A127587 A175832 * A345236 A321223 A082926

Adjacent sequences: A330958 A330959 A330960 * A330962 A330963 A330964

Keyword

nonn,base

Author

Rémy Sigrist, Jan 04 2020

Status

approved