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.

A330956 For any n >= 0: consider all pairs of numbers (x, y) whose binary representations can be interleaved (or shuffled) to produce the binary representation of n (possibly with leading zeros); 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 2
13 2
14 2
15 3
16 0
17 1
18 2
19 3
20 2
21 3
22 3
23 3
24 2
25 3
26 3
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 4
41 4
42 4
43 5
44 4
45 5
46 5
47 5
48 4
49 4
50 4
51 5
52 4
53 5
54 6
55 6
56 4
57 5
58 6
59 6
60 6
61 6
62 6
63 7
64 0
65 1
66 2
67 3
68 4
69 5
70 6
71 7
72 4
73 5
74 6
75 7
76 6
77 7
78 7
79 7
80 4
81 5
82 6
83 7
84 6
85 7
86 7

List of values

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