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.

A002375 From Goldbach conjecture: number of decompositions of 2n into an unordered sum of two odd primes.

Table of values

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

List of values

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