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.

A342156 For n > 2, a(n) = 0,1,2, or 3 when (prime(n+1) mod 6, prime(n) mod 6) = (1,1),(1,5),(5,1), or (5,5), respectively.

Table of values

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

List of values

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