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.

A108964 Write n in balanced ternary notation, omit any zeros and form the left-to-right alternating sum mod 3.

Table of values

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

List of values

[0, 1, 2, 1, 0, 1, 2, 0, 2, 1, 0, 2, 0, 1, 2, 1, 0, 1, 2, 0, 1, 0, 2, 1, 2, 0, 2, 1, 0, 2, 0, 1, 0, 2, 1, 2, 0, 1, 2, 1, 0, 1, 2, 0, 2, 1, 0, 2, 0, 1, 2, 1, 0, 1, 2, 0, 1, 0, 2, 0, 1, 2, 1, 0, 2, 1, 2, 0, 2, 1, 0, 1, 2, 0, 1, 0, 2, 1, 2, 0, 2, 1, 0, 2, 0, 1, 0, 2, 1, 2, 0, 1, 2, 1, 0, 2, 0, 1, 0, 2, 1, 0, 1, 2, 0, 2]