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.

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

List of values

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