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.

A237885 a(n) is the number of ways that 4n can be written as p+q (p>q) with p, q, (p-q)/2, 4n-(p-q)/2 all prime numbers.

Table of values

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

List of values

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