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.

A302754 Maximum remainder of prime(p) + prime(q) divided by p + q with p <= q <= n.

Table of values

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

List of values

[0, 2, 4, 6, 6, 6, 6, 6, 10, 18, 18, 22, 22, 24, 24, 24, 24, 24, 24, 24, 24, 26, 28, 34, 44, 46, 46, 46, 46, 46, 57, 58, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 62, 62, 62, 62, 62, 62, 70, 74, 78, 82, 82, 82, 82, 82, 90, 110, 110, 110, 110, 126, 130, 136, 138, 138, 142, 142, 142, 142]