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.

A317678 Sets of n distinct primes p_i in ascending order, written as triangle, such that S_n = Sum_{k=1..n} p_k is minimized and that there exists a compensation set of n primes q_j with q_j = n*p_j - Sum_{k=1..n,k!=j} p_k, j=1..n such that the set union {p_j} U {q_j} contains 2*n distinct primes and Sum_{k=1..n} q_k = S_n.

Table of values

n a(n)
1 1
2 11
3 17
4 37
5 43
6 61
7 29
8 31
9 37
10 41
11 67
12 71
13 73
14 83
15 101
16 97
17 101
18 103
19 107
20 113
21 139
22 179
23 181
24 191
25 199
26 211
27 223
28 241
29 223
30 227
31 229
32 233
33 239
34 257
35 269
36 283
37 223
38 227
39 229
40 233
41 239
42 241
43 251
44 257
45 317
46 347
47 349
48 353
49 359
50 367
51 373
52 397
53 401
54 421
55 443

List of values

[1, 11, 17, 37, 43, 61, 29, 31, 37, 41, 67, 71, 73, 83, 101, 97, 101, 103, 107, 113, 139, 179, 181, 191, 199, 211, 223, 241, 223, 227, 229, 233, 239, 257, 269, 283, 223, 227, 229, 233, 239, 241, 251, 257, 317, 347, 349, 353, 359, 367, 373, 397, 401, 421, 443]