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.

A229974 Number of ways to write n = x + y + z (x, y, z > 0) with the six numbers 2*x-1, 2*x+1, 2*x*y-1, 2*x*y+1, 2*x*y*z-1, 2*x*y*z+1 all prime.

Table of values

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

List of values

[0, 0, 0, 1, 1, 4, 2, 1, 2, 4, 5, 3, 3, 8, 1, 9, 4, 6, 3, 8, 16, 8, 4, 8, 7, 3, 10, 7, 3, 14, 4, 6, 8, 13, 12, 14, 6, 8, 13, 7, 13, 15, 13, 9, 9, 10, 7, 13, 14, 7, 16, 15, 12, 8, 16, 31, 11, 6, 16, 13, 16, 15, 26, 8, 10, 17, 10, 12, 11, 17, 9, 9, 13, 18, 17, 23, 14, 10, 7, 13, 29, 13, 18, 14, 9, 19, 21, 14, 19, 14, 25, 11, 14, 18, 13, 21, 15, 26, 14, 8]