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 A173176 #15 Mar 30 2012 18:40:08
%S A173176 7,13,19,31,43,61,73,103,109,139,151,181,193,199,229,241,271,283,313,
%T A173176 349,421,433,463,523,571,601,619,643,661,811,823,829,859,883,1021,
%U A173176 1033,1051,1063,1093,1153,1231,1279,1291,1303,1321,1429,1453,1483,1489,1609,1621,1669,1699,1723,1789,1873,1879,1933,1951,1999
%N A173176 Greater twin primes in A172240.
%C A173176 For a(n) > 5, first difference of the sequence is divisible by 6. (Conjectured or proved?)
%C A173176 Also for a(n)>5, a(n)-1 is divisible by 6, if a(n)-2 is prime p such that p+1 is divisible by 6.
%F A173176 A172240 INTERSECT A006512.
%p A173176 isA006512 := proc(p) isprime(p) and isprime(p-2) ; end proc:
%p A173176 isA000430 := proc(p) if isprime(p) then true; else if issqr(p) then isprime(sqrt(p)) ; else false; end if; end if; end proc:
%p A173176 isA181602 := proc(p) if isprime(p) then if numtheory[bigomega](p-1) =2 and isA000430(p+2) then true; else false; end if; else false; end if ; end proc:
%p A173176 isA181669 := proc(p) isA181602(p) and (p mod 6)= 5 ; end proc:
%p A173176 isA172240 := proc(n) isprime(n) and not isA181669(n) ; end proc:
%p A173176 isA173176 := proc(n) isA172240(n) and isA006512(n) ; end proc:
%p A173176 for n from 2 to 2000 do if isA173176(n) then printf("%d,",n) ; end if; end do:
%Y A173176 Cf. A172487, A181669, A181602.
%K A173176 nonn,easy
%O A173176 1,1
%A A173176 _Giovanni Teofilatto_, Nov 22 2010
%E A173176 Corrected by _R. J. Mathar_, Dec 01 2010