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.

A210681 Number of ways to write 2n = p+q+r (p<=q) with p, q, r-1, r+1 all prime and p-1, p+1, q-1, q+1, r all practical.

Table of values

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

List of values

[0, 0, 0, 0, 1, 2, 3, 3, 3, 2, 2, 3, 5, 6, 4, 3, 2, 4, 7, 10, 8, 5, 3, 5, 8, 12, 10, 6, 2, 3, 6, 11, 12, 6, 4, 3, 5, 9, 10, 6, 5, 4, 5, 8, 8, 5, 7, 7, 6, 8, 7, 6, 6, 8, 6, 7, 8, 5, 7, 8, 6, 7, 7, 4, 6, 7, 5, 6, 8, 4, 8, 6, 4, 5, 7, 5, 5, 8, 5, 6, 8, 6, 4, 7, 6, 6, 7, 5, 3, 7, 3, 4, 8, 6, 8, 5, 4, 3, 7, 6]