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.

A233567 Number of ways to write n = p + q (q > 0) with p and p^4 + phi(q)^4 both prime, where phi(.) is Euler's totient function (A000010).

Table of values

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

List of values

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