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.
%I A286269 #8 May 06 2017 11:48:47 %S A286269 2,8,19,48,53,108,113,210,197,510 %N A286269 The smallest weight possible for a cyclic prime vector of order n. %C A286269 A cyclic prime vector of order n is an array of n distinct primes P = (p_1, p_2, ..., p_n), such that every sum of an odd number of consecutive elements is also prime. Unlike normal prime vectors, here the sums are allowed to span from the end to the start of the array. The weight of the cyclic prime vector is the sum of its elements. For full details see Kamenetsky's paper. %H A286269 Dmitry Kamenetsky, <a href="https://arxiv.org/abs/1703.06778">Prime sums of primes</a>, arXiv:1703.06778 [math.HO], 2017. %e A286269 The best solution for n=5 is (5, 7, 17, 13, 11) with a weight of 53. This is a cyclic prime vector because all the generated sums are prime: 5+7+17=29, 7+17+13=37, 17+13+11=41, 13+11+5=29, 11+5+7=23, 5+7+17+13+11=53. %Y A286269 Cf. A286263. %K A286269 nonn,more %O A286269 1,1 %A A286269 _Dmitry Kamenetsky_, May 05 2017