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 A127351 #7 May 27 2025 18:46:16
%S A127351 2003,7883,31151,35363,394739,434939,541007,564983,837929,865979,
%T A127351 2453999,2680493,3479303,3536219,4145717,4367267,4706311,5414159,
%U A127351 6541103,6856019,8804231,9109223,10227323,10296059,10701683,10795507
%N A127351 Prime numbers n such that A127350(k) = 2*n for some k.
%C A127351 Primes of the form (Sum_{i=k..k+3}Sum_{j=i+1..k+4}prime(i)*prime(j))/2.
%C A127351 Primes of the form a/2 where a is the coefficient of x^3 of the polynomial Prod_{j=0,4}(x-prime(k+j)) for some k.
%t A127351 a = {}; Do[If[PrimeQ[(Prime[x] Prime[x + 1] + Prime[x] Prime[x + 2] + Prime[x] Prime[x + 3] + Prime[x] Prime[x + 4] + Prime[x + 1] Prime[x + 2] + Prime[x + 1] Prime[x + 3] + Prime[x + 1] Prime[x + 4] + Prime[x + 2] Prime[x + 3] + Prime[x + 2] Prime[x + 4] + Prime[x + 3] Prime[x + 4])/2], AppendTo[a, (Prime[x] Prime[x + 1] + Prime[x] Prime[x + 2] + Prime[x] Prime[x + 3] + Prime[x] Prime[x + 4] + Prime[x + 1] Prime[x + 2] + Prime[x + 1] Prime[x + 3] + Prime[x + 1] Prime[x + 4] + Prime[x + 2] Prime[x + 3] + Prime[x + 2] Prime[x + 4] + Prime[x + 3] Prime[x + 4])/2]], {x, 1, 1000}]; a
%o A127351 (PARI) {m=235;k=4;for(n=1,m,a=sum(i=n,n+k-1,sum(j=i+1,n+k,prime(i)*prime(j)));if(isprime(b=a/2),print1(b,",")))} \\ _Klaus Brockhaus_, Jan 21 2007
%o A127351 (PARI) {m=235;k=4;for(n=1,m,a=polcoeff(prod(j=0,k,(x-prime(n+j))),3);if(isprime(b=a/2),print1(b,",")))} \\ _Klaus Brockhaus_, Jan 21 2007
%Y A127351 Cf. A127350, A127345, A127346, A127347, A127348, A127349, A070934, A006094.
%K A127351 nonn
%O A127351 1,1
%A A127351 _Artur Jasinski_, Jan 11 2007
%E A127351 Edited by _Klaus Brockhaus_, Jan 21 2007