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.

A239238 a(n) = |{0 <= k < n: q(n+k*(k+1)/2) + 1 is prime}|, where q(.) is the strict partition function given by A000009.

Table of values

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

List of values

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