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.

A182662 Number of ordered ways to write n = p + q with q > 0 such that p, 3*(p + prime(q)) - 1 and 3*(p + prime(q)) + 1 are all prime.

Table of values

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

List of values

[0, 0, 1, 0, 1, 0, 1, 2, 1, 1, 1, 0, 3, 2, 1, 1, 4, 3, 1, 1, 3, 3, 2, 3, 3, 1, 2, 3, 4, 2, 1, 6, 4, 4, 1, 4, 2, 1, 5, 4, 2, 1, 2, 4, 2, 2, 3, 3, 3, 4, 2, 3, 3, 2, 3, 1, 5, 2, 3, 1, 5, 6, 4, 5, 3, 3, 1, 4, 3, 2, 3, 5, 3, 3, 7, 4, 3, 1, 4, 5, 4, 3, 2, 4, 2, 5, 5, 4, 2, 2, 6, 8, 2, 2, 4, 2, 6, 1, 3, 2]