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.

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

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

List of values

[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, 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, 0, 1, 2, 3, 9, 8, 8, 9, 8, 9, 10, 11, 5, 4, 7, 6, 1, 0]