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.

A237184 Number of ordered ways to write n = (1+(n mod 2))*p + q with p, q, phi(p+1) - 1 and phi(q-1) + 1 all prime.

Table of values

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

List of values

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