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.

A220091 Number of ways to write n=p+q+(n mod 2)q with p>q and p, q, 6q-1, 6q+1 all 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 1
11 2
12 1
13 1
14 1
15 1
16 2
17 3
18 2
19 1
20 2
21 2
22 2
23 3
24 2
25 2
26 2
27 3
28 1
29 2
30 1
31 1
32 1
33 3
34 2
35 2
36 3
37 2
38 1
39 1
40 2
41 2
42 1
43 2
44 2
45 2
46 3
47 3
48 3
49 1
50 2
51 3
52 2
53 3
54 3
55 1
56 1
57 4
58 2
59 1
60 3
61 1
62 1
63 3
64 4
65 3
66 3
67 2
68 1
69 1
70 3
71 3
72 1
73 2
74 2
75 4
76 4
77 5
78 3
79 1
80 1
81 3
82 2
83 3
84 3
85 2
86 2
87 4
88 2
89 3
90 3
91 0
92 1
93 5
94 2
95 2
96 3
97 1
98 0
99 2
100 3

List of values

[0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 3, 2, 1, 2, 2, 2, 3, 2, 2, 2, 3, 1, 2, 1, 1, 1, 3, 2, 2, 3, 2, 1, 1, 2, 2, 1, 2, 2, 2, 3, 3, 3, 1, 2, 3, 2, 3, 3, 1, 1, 4, 2, 1, 3, 1, 1, 3, 4, 3, 3, 2, 1, 1, 3, 3, 1, 2, 2, 4, 4, 5, 3, 1, 1, 3, 2, 3, 3, 2, 2, 4, 2, 3, 3, 0, 1, 5, 2, 2, 3, 1, 0, 2, 3]