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.

A053838 a(n) = (sum of digits of n written in base 3) modulo 3.

Table of values

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

List of values

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