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.

A233390 a(n) = |{0 < k < n: 2^k - 1 + q(n-k) is prime}|, where q(.) is the strict partition function (A000009).

Table of values

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

List of values

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