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.

A278923 Largest p such that 2n-1 = p + q + r with three primes p < q < r, or 0 if no such primes exist.

Table of values

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

List of values

[0, 0, 0, 0, 0, 0, 0, 3, 0, 3, 3, 5, 5, 3, 5, 7, 5, 7, 7, 7, 11, 11, 5, 11, 13, 11, 13, 13, 11, 17, 13, 13, 17, 17, 17, 19, 19, 13, 17, 19, 17, 23, 19, 19, 23, 23, 23, 23, 29, 23, 29, 29, 23, 29, 31, 31, 29, 31, 29, 31, 37, 29, 37, 37, 31, 41, 37, 31, 41, 37, 41, 43, 41, 41, 43, 43, 41, 43, 43, 47, 47, 43, 41, 47, 43, 47, 53, 47, 47, 53, 53, 53, 53, 59, 47]