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 A214197 #11 Jan 20 2018 22:30:50
%S A214197 2,3,5,7,11,19,23,47,59,61,71,101,113,223,487,661,719,811,947,1327,
%T A214197 1621,2039,2161,2377,2381,2699,2957,3011,3607,3727,4093,4549,4649,
%U A214197 5939,6473,8363,9601
%N A214197 Primes of the "second kind".
%C A214197 See Sun 2012 for precise definition. This term is overworked, and it would be good to include a more precise definition here.
%C A214197 Difference with A214196: sum of "primorial" products (A002110) is used here instead of difference. - _Jean-François Alcover_, Jan 20 2018
%H A214197 Zhi-Wei Sun, <a href="http://arxiv.org/abs/1202.6589">On functions taking only prime values</a>, arXiv preprint arXiv:1202.6589, 2012; see p. 5.
%t A214197 primorial[n_] := primorial[n] = Product[Prime[i], {i, 1, n}];
%t A214197 p[0] = 1; p[n_] := p[n] = Module[{m, i, j, ddvs}, For[m = 2, True, m++, ddvs = False; For[i = 1, i <= n - 1, i++, For[j = i + 1, j <= n, j++, If[Mod[primorial[j] + primorial[i], m] == 0, ddvs = True; Break[]]]; If[ddvs, Break[]]]; If[ddvs == False, Return[m]]]];
%t A214197 A214197 = Reap[n = k = 1; While[n <= 400, If[p[n] != p[n - 1], a[k] = p[n]; Print[n, " a(", k, ") = ", a[k]]; Sow[a[k]]; k++]; n++]][[2, 1]] (* _Jean-François Alcover_, Jan 20 2018, after _R. J. Mathar_ *)
%Y A214197 Cf. A214196.
%K A214197 nonn,more
%O A214197 1,1
%A A214197 _N. J. A. Sloane_, Jul 07 2012
%E A214197 a(21)-a(37) from _Jean-François Alcover_, Jan 20 2018