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.

A132194 a(n) = 1 if n-th prime is 0 or 2 mod 3, otherwise 0.

Table of values

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

List of values

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