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 A176834 #11 Aug 09 2016 14:50:42
%S A176834 7,11,13,17,19,37,53,89,127,179,181,307,449,541,577,593,683,719,809,
%T A176834 811,937,1259,1297,1567,1709,1801,1979,2467,2647,3061,3187,3457,3691,
%U A176834 3833,3907,4283,4357,4447,4463,4861,5003,5167,5849,5851,6247,6263,6337,6389
%N A176834 List of all primes p such that 3*A099609(2n-1)<p<3*A099609(2n).
%C A176834 Where A099609 is a naive list of twin primes (A077800 prefixed by 2,3).
%e A176834 a(1)=7 because 3*A099609(2*1-1)=6<7(prime)<3*A099609(2*1)=9; a(2)=11 and a(3)=13 because 3*A099609(2*2-1)=9<11(prime)<13(prime)<3*A099609(2*2)=15; a(4)=17 and a(5)=19 because 3*A099609(2*3-1)=15<17(prime)<19(prime)<3*A099609(2*3)=21.
%p A176834 Contribution from _R. J. Mathar_, May 10 2010: (Start)
%p A176834 A077800 := proc(n) if type(n,'even') then A006512(n/2) ; else A001359((n+1)/2) ; end if; end proc:
%p A176834 A099609 := proc(n) if n <= 2 then n+1 ; else A077800(n-2) ; end if; end proc:
%p A176834 for n from 1 to 100 do lpr := 3*A099609(2*n-1) ; upr := 3*A099609(2*n) ; for p from lpr+1 to upr-1 do if isprime(p) then printf("%d,",p) ; end if; end do: end do: (End)
%Y A176834 Cf. A171821.
%K A176834 nonn
%O A176834 1,1
%A A176834 _Juri-Stepan Gerasimov_, Apr 27 2010
%E A176834 Corrected (3691 inserted) by _R. J. Mathar_, May 10 2010