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.

A219966 Number of ways to write n=p+q+(n mod 2)q with q<=n/2 and p, q, q+6 all prime.

Table of values

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

List of values

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