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.

A328179 Number of distinct primes required to satisfy the Strong Goldbach Conjecture for all even numbers <= 2n.

Table of values

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

List of values

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