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.

A230040 Number of ways to write n = x + y + z with y <= z such that all the five numbers 6*x-1, 6*y-1, 6*z-1, 6*x*y-1 and 6*x*z-1 are Sophie Germain primes.

Table of values

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

List of values

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