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.

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

Table of values

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

List of values

[0, 1, 1, 1, 1, 1, 3, 3, 1, 1, 2, 3, 3, 3, 3, 3, 1, 1, 2, 3, 5, 5, 6, 7, 3, 3, 3, 3, 7, 7, 7, 7, 1, 1, 2, 3, 4, 5, 6, 7, 5, 5, 7, 7, 5, 5, 7, 7, 3, 3, 3, 3, 6, 7, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 2, 3, 4, 5, 6, 7, 9, 9, 10, 11, 12, 13, 14, 15, 5, 5, 7, 7, 5]