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.

A317680 Least sum S_n of n distinct primes p_i such that q_j = n*p_j - Sum_{k=1..n,k!=j} p_k, j=1..n is prime, such that the set union {p_i} U {q_i} contains 2*n distinct primes.

Table of values

n a(n)
2 28
3 141
4 138
5 395
6 660
7 1425
8 1960
9 2217
10 3810
11 5005
12 7230

List of values

[28, 141, 138, 395, 660, 1425, 1960, 2217, 3810, 5005, 7230]