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.

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

List of values

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