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.

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

List of values

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