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.

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

Table of values

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

List of values

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