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.

A235343 a(n) = |{0 < k < n: f(n,k) - 1, f(n,k) + 1 and q(f(n,k)) + 1 are all prime with f(n,k) = phi(k) + phi(n-k)/4}|, where phi(.) is Euler's totient function, and q(.) is the strict partition function (A000009).

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 0
11 0
12 0
13 0
14 1
15 1
16 0
17 0
18 1
19 2
20 3
21 3
22 2
23 4
24 2
25 2
26 3
27 4
28 4
29 2
30 3
31 0
32 3
33 2
34 3
35 3
36 3
37 3
38 4
39 0
40 2
41 1
42 1
43 2
44 2
45 1
46 2
47 2
48 2
49 1
50 1
51 2
52 4
53 0
54 2
55 1
56 5
57 2
58 2
59 0
60 2
61 3
62 2
63 3
64 4
65 4
66 2
67 2
68 2
69 1
70 3
71 6
72 3
73 3
74 1
75 5
76 2
77 2
78 2
79 4
80 2
81 2
82 2
83 2
84 2
85 3
86 2
87 2

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 2, 3, 3, 2, 4, 2, 2, 3, 4, 4, 2, 3, 0, 3, 2, 3, 3, 3, 3, 4, 0, 2, 1, 1, 2, 2, 1, 2, 2, 2, 1, 1, 2, 4, 0, 2, 1, 5, 2, 2, 0, 2, 3, 2, 3, 4, 4, 2, 2, 2, 1, 3, 6, 3, 3, 1, 5, 2, 2, 2, 4, 2, 2, 2, 2, 2, 3, 2, 2]