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.

A360016 Number of partitions of 4*n into four odd primes (p_1, p_2, p_3, p_4) (p_1 < p_2 <= p_3 < p_4 and p_1 + p_4 = p_2 + p_3 = 2*n) such that (p_1, p_2) and (p_3, p_4) are consecutive pairs of prime numbers with the same difference, d = p_2 - p_1 = p_4 - p_3, and (p_1, p_3), (p_2, p_4) are also consecutive pairs of prime numbers with the same difference, D = p_3 - p_1 = p_4 - p_2.

Table of values

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

List of values

[0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 2, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 3, 0]