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.

A171611 From Goldbach problem: number of decompositions of 2n into unordered sums of two primes > 3.

Table of values

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

List of values

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