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.

A233183 Number of ways to write n = k + m with 0 < k < m such that C(2*k, k) + prime(m) is prime.

Table of values

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

List of values

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