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.

A230037 Number of ways to write n = x + y + z (0 < x <= y <= z) such that the four pairs {6*x-1, 6*x+1}, {6*y-1, 6*y+1}, {6*z-1, 6*z+1} and {6*x*y-1, 6*x*y+1} are twin prime pairs.

Table of values

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

List of values

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