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.
A099609(2n).
%I A176831 #10 Mar 18 2017 08:35:30 %S A176831 5,7,11,13,23,37,59,61,83,277,359,383,397,457,479,541,563,839,863, %T A176831 1201,1237,1283,1319,1321,1619,1621,1657,2039,2063,2099,2459,2557, %U A176831 2579,2857,2903,2963,3217,3863,4057,4177,4259,4261,4283,4621,4679,5099,5101,5581 %N A176831 List of all primes p such that 2*A099609(2n-1)<p<2*A099609(2n). %C A176831 Where A099609 is a naive list of twin primes (A077800 prefixed by 2,3). %H A176831 Michael De Vlieger, <a href="/A176831/b176831.txt">Table of n, a(n) for n = 1..10000</a> %e A176831 a(1)=5 because 2*A099609(2*1-1)=4<5(prime)<2*A099609(2*1)=6; %e A176831 a(2)=7 because 2*A099609(2*2-1)=6<7(prime)<2*A099609(2*2)=10; %e A176831 a(3)=11 and a(4)=13 because 2*A099609(2*3-1)<11(prime)<13(prime)<2*A099609(2*3). %t A176831 Flatten@ Map[Select[Range @@ #, PrimeQ] &, 2 Select[Partition[#, 2, 1] &@ Prime@ Range@ 410, First@ Differences@ # <= 2 &]] (* _Michael De Vlieger_, Mar 18 2017 *) %Y A176831 Cf. A077800, A099609, A171821. %K A176831 nonn %O A176831 1,1 %A A176831 _Juri-Stepan Gerasimov_, Apr 27 2010 %E A176831 Entries checked by _R. J. Mathar_, May 10 2010