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.

A190893 a(n) = [3en] - 3[en], where [ ] = floor.

Table of values

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

List of values

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