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.

A230194 Number of ways to write n = x + y + z (x, y, z > 0) such that all the 11 integers 6*x-1, 6*x+1, 6*x-5, 6*x+5, 6*y-1, 6*y-5, 6*y+5, 6*(x+y)+5, 6*z-1, 6*z-5 and 6*z+5 are prime.

Table of values

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

List of values

[0, 0, 0, 0, 0, 1, 1, 3, 3, 3, 4, 3, 6, 5, 3, 3, 3, 5, 4, 4, 4, 2, 9, 10, 9, 7, 5, 12, 8, 2, 8, 6, 6, 7, 9, 4, 3, 10, 11, 2, 4, 6, 10, 9, 11, 9, 4, 10, 17, 9, 1, 4, 7, 6, 6, 6, 2, 5, 14, 13, 7, 5, 14, 6, 3, 5, 4, 12, 11, 14, 5, 2, 16, 11, 5, 9, 6, 8, 11, 23, 15, 3, 23, 18, 17, 9, 8, 20, 5, 10, 14, 3, 14, 15, 16, 9, 8, 24, 10, 7]