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.

A065252 The sequence A065251 reduced modulo 3 (i.e., replace every -1 with 2).

Table of values

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

List of values

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