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.

A229969 Number of ways to write n = x + y + z with 0 < x <= y <= z such that all the six numbers 2*x-1, 2*y-1, 2*z-1, 2*x*y-1, 2*x*z-1, 2*y*z-1 are prime.

Table of values

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

List of values

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