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.

A233150 Number of ways to write n = k + m (k, m > 0) with 2^k + prime(m) prime.

Table of values

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

List of values

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