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.

A090193 a(n) = A053838(n) + 1 modulo 3.

Table of values

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

List of values

[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, 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, 2, 0, 1, 0, 1, 2, 1, 2, 0, 0, 1, 2, 1, 2, 0, 2, 0, 1, 1, 2, 0, 2, 0, 1]