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.

A024712 a(n) = residue mod 3 of n-th term of A024702.

Table of values

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

List of values

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