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.

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

Table of values

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

List of values

[1, 1, 1, 1, 1, 3, 2, 2, 2, 10, 3, 1, 3, 8, 3, 6, 4, 2, 4, 9, 9, 4, 4, 8, 2, 2, 2, 3, 11, 8, 4, 13, 19, 4, 1, 6, 3, 4, 2, 4, 26, 12, 5, 11, 11, 9, 6, 5, 25, 4, 24, 6, 4, 2, 5, 9, 9, 2, 7, 4, 28, 13, 8, 27, 9, 23, 3, 7, 2, 24, 36, 38, 9, 26, 16, 1]

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

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