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.

A239701 Least k > 0 such that q(n)+k is prime, where 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 5
17 3
18 1
19 5
20 3
21 3
22 8
23 3
24 5
25 7
26 2
27 1
28 1
29 1
30 11
31 7
32 7
33 1
34 9
35 2
36 5
37 1
38 13
39 1
40 4
41 17
42 1
43 3
44 7
45 5
46 5
47 1
48 7
49 7
50 1
51 2
52 1
53 27
54 19
55 1
56 1
57 2
58 11
59 11
60 3
61 21
62 3
63 3
64 3
65 11
66 11
67 9
68 17
69 13
70 20
71 1
72 1
73 5
74 7
75 3
76 17
77 12

List of values

[1, 1, 1, 1, 1, 2, 1, 2, 1, 3, 1, 1, 2, 1, 1, 2, 5, 3, 1, 5, 3, 3, 8, 3, 5, 7, 2, 1, 1, 1, 11, 7, 7, 1, 9, 2, 5, 1, 13, 1, 4, 17, 1, 3, 7, 5, 5, 1, 7, 7, 1, 2, 1, 27, 19, 1, 1, 2, 11, 11, 3, 21, 3, 3, 3, 11, 11, 9, 17, 13, 20, 1, 1, 5, 7, 3, 17, 12]