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 A060231 #13 Jan 30 2018 00:35:44 %S A060231 2309,9239,11549,25409,34649,43889,55439,78539,92399,110879,117809, %T A060231 133979,152459,168629,180179,224069,226379,230999,244859,251789, %U A060231 267959,270269,284129,297989,300299,309539,314159,316469,330329,376529,390389 %N A060231 Smaller of twin primes whose middle term is a multiple of A002110(5)=2310. %C A060231 Number of terms less than 10^k: 0, 0, 0, 0, 2, 9, 66, 422, 3255, ... - _Muniru A Asiru_, Jan 29 2018 %H A060231 Muniru A Asiru, <a href="/A060231/b060231.txt">Table of n, a(n) for n = 1..1000</a> %e A060231 For the pair {9239,9241} (9239+9241)/2 = 4*2310. %p A060231 select(n->isprime(n) and isprime(n+2), [seq(2310*k-1, k=1..10^3)]); # _Muniru A Asiru_, Jan 29 2018 %t A060231 Select[2310*Range[200],And@@PrimeQ[#+{1,-1}]&]-1 (* _Harvey P. Dale_, Aug 23 2013 *) %o A060231 (GAP) P:=Filtered([1..10^5], IsPrime);; %o A060231 P1:=List(Filtered(Filtered(List([1..Length(P)-1], n -> [P[n],P[n+1]]),i -> i[2]-i[1] = 2), j -> (j[1]+j[2]) mod 2310 = 0), k -> k[1]); # _Muniru A Asiru_, Jan 29 2018 %o A060231 (PARI) is(n)=(n+1)%2310==0 && isprime(n+2) && isprime(n) \\ _Charles R Greathouse IV_, Jan 30 2018 %Y A060231 Cf. A001359, A002110, A060229, A060230. %K A060231 nonn %O A060231 1,1 %A A060231 _Labos Elemer_, Mar 21 2001 %E A060231 Minor edits by _Ray Chandler_, Apr 02 2009