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.

A327192 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 max(x, y).

Table of values

n a(n)
0 0
1 1
2 1
3 1
4 1
5 1
6 2
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 4
21 5
22 5
23 5
24 3
25 3
26 3
27 3
28 4
29 5
30 6
31 7
32 1
33 1
34 2
35 3
36 4
37 5
38 6
39 7
40 5
41 5
42 5
43 5
44 5
45 5
46 6
47 7
48 3
49 3
50 3
51 3
52 4
53 5
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 8
73 9
74 9
75 9
76 9
77 9
78 9
79 9
80 5
81 5
82 5
83 5
84 5
85 5
86 6

List of values

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