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.

A227923 Number of ways to write n = x + y (x, y > 0) such that 6*x-1 is a Sophie Germain prime and {6*y-1, 6*y+1} is a twin prime pair.

Table of values

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

List of values

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