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.

A218829 Number of ordered ways to write n = k + m with k > 0 and m > 0 such that prime(k) + 2 and prime(prime(m)) + 2 are both prime.

Table of values

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

List of values

[0, 0, 1, 2, 2, 3, 2, 3, 4, 2, 3, 2, 2, 3, 2, 4, 3, 2, 3, 3, 3, 1, 3, 3, 1, 4, 4, 2, 3, 4, 4, 4, 4, 5, 3, 4, 4, 1, 4, 4, 3, 5, 4, 3, 3, 4, 6, 3, 5, 5, 3, 3, 3, 2, 4, 5, 4, 5, 4, 2, 3, 4, 4, 5, 5, 7, 4, 5, 2, 6, 4, 5, 7, 3, 5, 6, 2, 4, 3, 2]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.