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.

A327193 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 greatest possible value of min(x, y).

Table of values

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

List of values

[0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 2, 2, 1, 1, 2, 3, 0, 1, 2, 3, 2, 2, 2, 3, 1, 1, 2, 3, 3, 3, 3, 3, 0, 1, 2, 3, 4, 4, 4, 4, 2, 2, 2, 3, 4, 5, 5, 5, 1, 1, 2, 3, 4, 5, 6, 6, 3, 3, 3, 3, 4, 5, 6, 7, 0, 1, 2, 3, 4, 5, 6, 7, 4, 4, 4, 4, 4, 5, 6, 7, 2, 2, 2, 3, 4, 5, 6]