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.

A060585 Write n in base 3, then (working from left to right) if the k-th digit of n is not equal to the digit to its left then the k-th digit of a(n) is 1, otherwise it is 0, and finally read the result as a base-2 number.

Table of values

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

List of values

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