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.

A234504 Number of ways to write n = k + m with k > 0 and m > 0 such that 2^(phi(k) + phi(m)/4) - 5 is prime, where phi(.) is Euler's totient function.

Table of values

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

List of values

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