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.

A238457 a(n) = |{0 < k <= n: p(n) + k is prime}|, where p(.) is the partition function (A000041).

Table of values

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

List of values

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