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.

A239936 Least k > 0 such that p(k)+q(n) is prime, where p(n) is the number of partitions of n and q(n) is the number of strict partitions of n.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 2
6 1
7 2
8 1
9 3
10 1
11 1
12 2
13 1
14 1
15 2
16 4
17 3
18 1
19 4
20 3
21 3
22 10
23 3
24 4
25 5
26 2
27 1
28 1
29 1
30 6
31 5
32 5
33 1
34 6
35 2
36 4
37 1
38 12
39 1
40 15
41 13
42 1
43 3
44 5
45 4
46 4
47 1
48 5
49 5
50 1
51 2
52 1
53 12
54 49
55 1
56 1
57 2
58 6
59 6
60 3
61 14
62 3
63 3
64 3
65 6
66 6
67 16
68 13
69 16
70 11
71 1
72 1
73 4
74 5
75 3
76 12
77 25

List of values

[1, 1, 1, 1, 1, 2, 1, 2, 1, 3, 1, 1, 2, 1, 1, 2, 4, 3, 1, 4, 3, 3, 10, 3, 4, 5, 2, 1, 1, 1, 6, 5, 5, 1, 6, 2, 4, 1, 12, 1, 15, 13, 1, 3, 5, 4, 4, 1, 5, 5, 1, 2, 1, 12, 49, 1, 1, 2, 6, 6, 3, 14, 3, 3, 3, 6, 6, 16, 13, 16, 11, 1, 1, 4, 5, 3, 12, 25]