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.

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

Table of values

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

List of values

[1, 1, 1, 2, 2, 4, 2, 2, 1, 1, 1, 3, 2, 2, 2, 3, 2, 10, 4, 1, 4, 5, 7, 4, 4, 15, 1, 1, 1, 2, 19, 15, 4, 8, 13, 4, 4, 10, 2, 4, 1, 4, 15, 16, 6, 3, 5, 5, 10, 6, 7, 4, 20, 10, 4, 1, 6, 13, 3, 1, 14, 4, 25, 8, 21, 39, 29, 8, 2, 14, 1, 34, 16, 12, 17]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.