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 A176181 #15 Aug 02 2019 21:57:36
%S A176181 13,31,37,61,73,89,97,109,113,151,157,181,193,199,211,229,241,271,277,
%T A176181 313,331,349,367,373,389,397,401,421,433,449,457,523,541,571,601,607,
%U A176181 613,619,631,661,673,691,701,727,733,751,757,761,769,811,853,877,929
%N A176181 Primes p(n) such that gcd(p(n)-1, p(n+1)-1) > gcd(p(n)+1, p(n+1)+1).
%C A176181 Sequence does not contain any lesser of twin primes A001359. (Proof. If p(n+1) = p(n)+2, then gcd(p(n)-1, p(n+1)-1) = 2 = gcd(p(n)+1, p(n+1)+1), so p(n) is not a term.) - _Jonathan Sondow_, Feb 03 2012
%H A176181 Harvey P. Dale, <a href="/A176181/b176181.txt">Table of n, a(n) for n = 1..1000</a>
%t A176181 lst={}; Do[p0=Prime[n]; p1=Prime[n+1]; If[GCD[p0-1,p1-1] > GCD[p0+1,p1+1], AppendTo[lst,p0]], {n,200}]; lst
%t A176181 Transpose[Select[Partition[Prime[Range[200]],2,1],GCD@@(#-1)>GCD@@(#+1)&]] [[1]] (* _Harvey P. Dale_, Sep 30 2014 *)
%Y A176181 Cf. A063091, A176180.
%K A176181 nonn
%O A176181 1,1
%A A176181 _Vladimir Joseph Stephan Orlovsky_, Apr 11 2010
%E A176181 Definition clarified by _Jonathan Sondow_, Feb 03 2012