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.

A327188 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 x AND y (where AND denotes the bitwise AND operator).

Table of values

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

List of values

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