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 A274057 #13 Jun 18 2016 00:49:49 %S A274057 2,112,114,116,364,366,368,394,396,398,484,486,488,694,696,698,934, %T A274057 936,938,1402,1404,1406 %N A274057 Even numbers n that cannot be written as the difference of two primes, each of which is one of a pair of twin primes, and one of which is < n. %C A274057 There are no more terms less than 10^5. %C A274057 There are no more terms less than 10^8. Probably there are no more terms; a Cramér model predicts that the chance of more terms existing is less than 1 in 10^2000. - _Charles R Greathouse IV_, Jun 17 2016 %o A274057 (PARI) is(n)=my(p=2); forprime(q=3,n+1,if(q-p!=2,p=q;next); if(isprime(n+p) && (isprime(n+p-2) || isprime(n+p+2)),return(0)); if(isprime(n+q) && (isprime(n+q-2) || isprime(n+q+2)) && q<n,return(0));p=q);1 \\ _Charles R Greathouse IV_, Jun 17 2016 %K A274057 nonn %O A274057 1,1 %A A274057 _Thomas Curtright_, Jun 08 2016