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.

A061358 Number of ways of writing n = p+q with p, q primes and p >= q.

Table of values

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

List of values

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