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.

A237496 Number of ordered ways to write n = k + m (0 < k <= m) with pi(k) + pi(m) - 2 prime, where pi(.) is given by A000720.

Table of values

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

List of values

[0, 0, 0, 0, 0, 1, 2, 4, 4, 3, 2, 3, 3, 3, 5, 3, 1, 4, 5, 5, 7, 4, 1, 2, 1, 1, 1, 1, 1, 3, 6, 7, 8, 8, 8, 8, 8, 9, 11, 11, 11, 11, 9, 7, 7, 4, 1, 2, 1, 2, 3, 5, 7, 10, 14, 14, 14, 10, 6, 10, 14, 16, 19, 16, 13, 12, 11, 10, 7, 6, 5, 3, 3, 4, 3, 6, 9, 13, 17, 18]