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.

A239232 a(n) = |{0 < k <= n: p(n+k) + 1 is prime}|, where p(.) is the partition function (A000041).

Table of values

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

List of values

[1, 0, 0, 1, 3, 3, 3, 2, 1, 1, 1, 1, 2, 4, 4, 4, 4, 4, 3, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 3, 4, 5, 5, 4, 4, 4, 4, 4, 4, 5, 5, 6, 6, 7, 6, 6, 6, 6, 7, 8, 8, 9, 9, 9, 10]

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

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