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.

A271497 If n is a multiple of 3 then a(n) = n/3, otherwise a(n) = n'+n'', where n' (resp. n'') is obtained by sorting the bits of the binary expansion of n into increasing (resp. decreasing) order.

Table of values

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

List of values

[0, 2, 3, 1, 5, 9, 2, 14, 9, 3, 15, 21, 4, 21, 21, 5, 17, 27, 6, 35, 27, 7, 35, 45, 8, 35, 35, 9, 35, 45, 10, 62, 33, 11, 51, 63, 12, 63, 63, 13, 51, 63, 14, 75, 63, 15, 75, 93, 16, 63, 63, 17, 63, 75, 18, 93, 63, 19, 75, 93, 20, 93, 93, 21, 65, 99, 22, 119, 99, 23, 119, 135, 24, 119, 119, 25, 119, 135]