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.

A304794 a(n) is the least possible difference between the greatest and the smallest prime in any partition of prime(n) into three primes p+q+r (p <= q <= r); n >= 4.

Table of values

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

List of values

[1, 2, 2, 2, 2, 6, 4, 6, 2, 6, 4, 4, 2, 6, 4, 10, 10, 12, 12, 8, 2, 8, 12, 8, 12, 10, 10, 2, 6, 4, 10, 10, 18, 18, 18, 8, 8, 2, 2, 12, 8, 12, 10, 6, 8, 12, 8, 12, 10, 4, 10, 10, 14, 14, 24, 14, 14, 8, 14, 2, 6, 4, 4, 4, 24, 20, 18, 14, 28, 14, 28, 26, 26, 4, 12]