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.

A330958 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 least possible value of x OR y (where OR denotes the bitwise OR operator).

Table of values

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

List of values

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