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.

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

Table of values

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

List of values

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

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

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