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.

A330940 a(n) is the least value whose binary representation can be obtained by interleaving (or shuffling) two copies of the binary representation of n.

Table of values

n a(n)
0 0
1 3
2 10
3 15
4 36
5 43
6 54
7 63
8 136
9 147
10 170
11 175
12 204
13 219
14 238
15 255
16 528
17 547
18 586
19 591
20 660
21 683
22 694
23 703
24 792
25 819
26 858
27 879
28 924
29 955
30 990
31 1023
32 2080
33 2115
34 2186
35 2191
36 2340
37 2347
38 2358
39 2367
40 2600
41 2643
42 2730
43 2735
44 2764
45 2779
46 2798
47 2815
48 3120
49 3171

List of values

[0, 3, 10, 15, 36, 43, 54, 63, 136, 147, 170, 175, 204, 219, 238, 255, 528, 547, 586, 591, 660, 683, 694, 703, 792, 819, 858, 879, 924, 955, 990, 1023, 2080, 2115, 2186, 2191, 2340, 2347, 2358, 2367, 2600, 2643, 2730, 2735, 2764, 2779, 2798, 2815, 3120, 3171]