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.

A273457 Even numbers 2n that do not have a Goldbach partition 2n = p + q (p < q; p, q prime) satisfying sqrt(n) < p <= sqrt(2n).

Table of values

n a(n)
1 2
2 4
3 6
4 8
5 12
6 18
7 20
8 22
9 24
10 26
11 30
12 32
13 38
14 40
15 44
16 52
17 56
18 58
19 62
20 64
21 70
22 72
23 76
24 82
25 84
26 88
27 92
28 94
29 98
30 100
31 102
32 104
33 106
34 108
35 110
36 112
37 114
38 116
39 118
40 120
41 122
42 126
43 128
44 130
45 132
46 134
47 136
48 140
49 144
50 146
51 152
52 154
53 156
54 158
55 164
56 166
57 172
58 182
59 188
60 196
61 198
62 200
63 214

List of values

[2, 4, 6, 8, 12, 18, 20, 22, 24, 26, 30, 32, 38, 40, 44, 52, 56, 58, 62, 64, 70, 72, 76, 82, 84, 88, 92, 94, 98, 100, 102, 104, 106, 108, 110, 112, 114, 116, 118, 120, 122, 126, 128, 130, 132, 134, 136, 140, 144, 146, 152, 154, 156, 158, 164, 166, 172, 182, 188, 196, 198, 200, 214]