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.

A339601 Starting from x_0 = n, iterate by dividing with 3 (discarding any remainder), until zero is reached: x_1 = floor(x_0/3), x_2 = floor(x_1/3), etc. Then a(n) = Sum_{i=0..} (x_i AND 2^i), where AND is bitwise-and.

Table of values

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

List of values

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