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.

A106671 a(n) = ( prime(n + 2) * prime(n) - prime(n + 1)^2 ) modulo 3.

Table of values

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

List of values

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