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.

A330960 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 + 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 3
21 4
22 5
23 6
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 3
37 4
38 5
39 6
40 3
41 4
42 5
43 6
44 7
45 8
46 9
47 10
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 3
69 4
70 5
71 6
72 3
73 4
74 5
75 6
76 7
77 8
78 9
79 10
80 3
81 4
82 5
83 6

List of values

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