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.

A090239 a(n) = A053838(n) + 2 modulo 3.

Table of values

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

List of values

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