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.

A235358 a(n) = |{0 < k < n: g(n,k) - 1, g(n,k) + 1 and q(g(n,k)) - 1 are all prime with g(n,k) = phi(k) + phi(n-k)/8}|, 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 0
15 0
16 0
17 0
18 0
19 0
20 0
21 0
22 1
23 0
24 0
25 1
26 0
27 1
28 0
29 1
30 0
31 0
32 0
33 0
34 0
35 0
36 0
37 1
38 0
39 1
40 1
41 0
42 3
43 1
44 2
45 1
46 1
47 0
48 1
49 0
50 1
51 0
52 1
53 1
54 1
55 1
56 2
57 2
58 1
59 0
60 1
61 0
62 0
63 0
64 0
65 1
66 0
67 1
68 2
69 0
70 2
71 1
72 2
73 0
74 1
75 0
76 1
77 1
78 0
79 0
80 0
81 0
82 0
83 2
84 2
85 0
86 1
87 0
88 0
89 1
90 1
91 0
92 0
93 0
94 0
95 0
96 0
97 0
98 0
99 1
100 1

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 3, 1, 2, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 2, 2, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 2, 0, 2, 1, 2, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 2, 2, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1]