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.

A236412 a(n) = |{0 < k < n: m = phi(k)/2 + phi(n-k)/8 is an integer with p(m)^2 + q(m)^2 prime}|, where phi(.) is Euler's totient, p(.) is the partition function (A000041) 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 1
7 1
8 0
9 1
10 1
11 1
12 1
13 1
14 2
15 1
16 0
17 0
18 1
19 2
20 3
21 3
22 4
23 5
24 3
25 4
26 4
27 7
28 4
29 5
30 5
31 3
32 3
33 4
34 5
35 4
36 3
37 6
38 8
39 3
40 3
41 3
42 7
43 3
44 7
45 4
46 5
47 3
48 6
49 3
50 2
51 3
52 6
53 3
54 3
55 2
56 5
57 1
58 4
59 6
60 4
61 3
62 3
63 7
64 5
65 3
66 3
67 3
68 4
69 1
70 5
71 4
72 3
73 2
74 4
75 3
76 6
77 2
78 5
79 6
80 4
81 5
82 2
83 1
84 6
85 4
86 4
87 2
88 11
89 1
90 6
91 3
92 5
93 6
94 7
95 2
96 4
97 4
98 2
99 3
100 2

List of values

[0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 2, 1, 0, 0, 1, 2, 3, 3, 4, 5, 3, 4, 4, 7, 4, 5, 5, 3, 3, 4, 5, 4, 3, 6, 8, 3, 3, 3, 7, 3, 7, 4, 5, 3, 6, 3, 2, 3, 6, 3, 3, 2, 5, 1, 4, 6, 4, 3, 3, 7, 5, 3, 3, 3, 4, 1, 5, 4, 3, 2, 4, 3, 6, 2, 5, 6, 4, 5, 2, 1, 6, 4, 4, 2, 11, 1, 6, 3, 5, 6, 7, 2, 4, 4, 2, 3, 2]