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.

A066286 For even n>=4, let f(n)=A066285(n/2) be the minimal difference between primes p and q whose sum is n. This sequence contains the successive maxima of f.

Table of values

n a(n)
0 0
1 2
2 6
3 18
4 30
5 36
6 42
7 54
8 66
9 78
10 84
11 90
12 96
13 150
14 174
15 186
16 234
17 240
18 270
19 276
20 336
21 366
22 420
23 456
24 600
25 666
26 738
27 786
28 906
29 1050
30 1242
31 1440
32 1620
33 1692
34 2172
35 2562
36 2610
37 3030
38 3180
39 3234
40 3444
41 3588
42 3666
43 3702
44 4020
45 4128
46 4170
47 4224
48 4434
49 4704
50 5508
51 5568
52 6678
53 6858
54 8790
55 8976
56 10782

List of values

[0, 2, 6, 18, 30, 36, 42, 54, 66, 78, 84, 90, 96, 150, 174, 186, 234, 240, 270, 276, 336, 366, 420, 456, 600, 666, 738, 786, 906, 1050, 1242, 1440, 1620, 1692, 2172, 2562, 2610, 3030, 3180, 3234, 3444, 3588, 3666, 3702, 4020, 4128, 4170, 4224, 4434, 4704, 5508, 5568, 6678, 6858, 8790, 8976, 10782]