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.

A233204 Number of ways to write n = k + m with 0 < k < m such that 2^k * prime(m) + 3 is prime.

Table of values

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

List of values

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