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 A175873 #11 Feb 23 2017 02:40:23 %S A175873 13,17,19,23,37,47,67,89,103,107,109,113,131,151,173,193,199,233,239, %T A175873 269,277,317,353,359,373,389,409,431,433,443,449,463,467,499,503,563, %U A175873 577,593,607,619,653,709,719,727,773,811,823,829,863,881,887,911,937,947,997,1033 %N A175873 Primes of the form prime(k+1) + prime(k+2) - prime(k). %C A175873 Some terms can be obtained in more than one way. %C A175873 For example 47 =37+41-31 = 41+43-37. %C A175873 The formula in the definition adds a previous prime gap prime(k+1)-prime(k) to the prime(k+2); the gap is basically >=2, so there is a minimal growth which yields safe bounds to algorithms. %H A175873 Charles R Greathouse IV, <a href="/A175873/b175873.txt">Table of n, a(n) for n = 1..10000</a> %e A175873 13 = 7+11-5, 17=11+13-7 %o A175873 (PARI) list(lim)=my(v=List(),t,p=2,q=3); forprime(r=5,lim-2, t=q+r-p; if(isprime(t) && t<=lim, listput(v,t)); p=q; q=r); Set(v) \\ _Charles R Greathouse IV_, Feb 23 2017 %K A175873 nonn %O A175873 1,1 %A A175873 _Claudio Meller_, Dec 05 2010