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.

A209315 Number of ways to write 2n-1 = p+q with q practical, p and q-p both prime.

Table of values

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

List of values

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