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.

A068307 From Goldbach problem: number of decompositions of n into a sum of three primes.

Table of values

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

List of values

[0, 0, 0, 0, 0, 1, 1, 1, 2, 1, 2, 2, 2, 1, 3, 2, 4, 2, 3, 2, 5, 2, 5, 3, 5, 3, 7, 3, 7, 2, 6, 3, 9, 2, 8, 4, 9, 4, 10, 2, 11, 3, 10, 4, 12, 3, 13, 4, 12, 5, 15, 4, 16, 3, 14, 5, 17, 3, 16, 4, 16, 6, 19, 3, 21, 5, 20, 6, 20, 2, 22, 5, 21, 6, 22, 5, 28, 5, 24, 7]