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.

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

Table of values

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

List of values

[2, 1, 1, 2, 1, 2, 1, 8, 3, 2, 1, 2, 1, 9, 3, 2, 1, 2, 1, 8, 3, 2, 1, 9, 4, 8, 3, 2, 1, 2, 1, 8, 4, 11, 3, 2, 1, 8, 3, 2, 1, 2, 1, 9, 3, 2, 1, 10, 4, 8, 3, 2, 1, 9, 4, 10, 3, 2, 1, 2, 1, 8, 4, 15, 3, 2, 1, 8, 3, 2, 1, 2, 1, 9, 4, 8, 3, 2, 1, 8, 3, 2]

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

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