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.

A236442 Number of ordered ways to write n = k + m with k > 0 and m > 0 such that A000009(k) + A047967(m) is prime.

Table of values

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

List of values

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