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.

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

List of values

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