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.

A330941 a(n) is the greatest 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 12
3 15
4 48
5 53
6 60
7 63
8 192
9 201
10 212
11 219
12 240
13 245
14 252
15 255
16 768
17 785
18 804
19 819
20 848
21 853
22 876
23 887
24 960
25 969
26 980
27 987
28 1008
29 1013
30 1020
31 1023
32 3072
33 3105
34 3140
35 3171
36 3216
37 3237
38 3276
39 3303
40 3392
41 3401
42 3412
43 3435
44 3504
45 3509
46 3548
47 3567
48 3840
49 3857

List of values

[0, 3, 12, 15, 48, 53, 60, 63, 192, 201, 212, 219, 240, 245, 252, 255, 768, 785, 804, 819, 848, 853, 876, 887, 960, 969, 980, 987, 1008, 1013, 1020, 1023, 3072, 3105, 3140, 3171, 3216, 3237, 3276, 3303, 3392, 3401, 3412, 3435, 3504, 3509, 3548, 3567, 3840, 3857]