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.

A230219 Number of ways to write 2*n + 1 = p + q + r with p <= q such that p, q, r are primes in A230217 and p + q + 9 is also prime.

Table of values

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

List of values

[0, 0, 0, 0, 0, 0, 1, 1, 1, 2, 1, 2, 5, 2, 2, 4, 3, 1, 4, 3, 1, 4, 1, 2, 5, 2, 3, 4, 3, 3, 8, 6, 3, 12, 6, 2, 13, 3, 3, 7, 6, 4, 5, 4, 4, 8, 7, 4, 12, 7, 3, 19, 6, 3, 16, 5, 4, 9, 5, 5, 7, 10, 4, 5, 8, 3, 14, 4, 3, 14, 2, 5, 12, 5, 2, 14, 9, 2, 10, 12, 4, 12, 7, 6, 12, 7, 9, 14, 8, 6, 12, 5, 4, 19, 8, 4, 23, 6, 3, 14]