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.

A327189 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 + y.

Table of values

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

List of values

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