cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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).

Table of values

n a(n)
0 0
1 1
2 1
3 0
4 1
5 0
6 3
7 2
8 1
9 0
10 0
11 1
12 0
13 1
14 1
15 0
16 1
17 0
18 0
19 1
20 0
21 1
22 1
23 0
24 3
25 2
26 1
27 0
28 4
29 5
30 5
31 4
32 1
33 0
34 0
35 1
36 0
37 1
38 1
39 0
40 0
41 1
42 1
43 0
44 1
45 0
46 3
47 2
48 0
49 1
50 1
51 0
52 1
53 0
54 0
55 1
56 2
57 3
58 0
59 1
60 0
61 1
62 1
63 0
64 1
65 0
66 0
67 1
68 0
69 1
70 1
71 0
72 0
73 1
74 1
75 0
76 1
77 0
78 3
79 2
80 0
81 1
82 1
83 0
84 1
85 0
86 0

List of values

[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]