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.

A236548 Number of ways to write n = k^2 + m with k > 0 and m > 0 such that phi(k^2) + prime(m) is prime, where phi(.) is Euler's totient function.

Table of values

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

List of values

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