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.

A233307 a(n) = |{0 < k < n: p(k)^2 + q(n-k)^2 is prime}|, where p(.) is the partition function (A000041) and q(.) is the strict partition function (A000009).

Table of values

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

List of values

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