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.

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

List of values

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