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.

A213202 Number of ways to write n = p + sum_{k=1..m}(-1)^(m-k)*p_k, where p is a Sophie Germain prime and p_k is the k-th prime.

Table of values

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

List of values

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