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 A060230 #14 Jan 29 2018 23:28:01 %S A060230 419,1049,2309,2729,3359,5879,6089,6299,7349,7559,8819,9239,10499, %T A060230 10709,11549,11969,15329,18059,21839,25409,26249,26879,28349,29399, %U A060230 30869,31079,32969,33179,33599,33809,34649,35279,37589,40529,42839 %N A060230 Smaller of twin primes whose middle term is a multiple of A002110(4)=210. %C A060230 Number of terms less than 10^k: 0, 0, 0, 1, 12, 80, 542, 3908, 29229, ... - _Muniru A Asiru_, Jan 29 2018 %H A060230 Harvey P. Dale, <a href="/A060230/b060230.txt">Table of n, a(n) for n = 1..1000</a> %e A060230 For the pair {1049,1051} (1049+1051)/2 = 5*210. %p A060230 select(n->isprime(n) and isprime(n+2), [seq(210*k - 1, k=1..10^3)]); # _Muniru A Asiru_, Jan 29 2018 %t A060230 Select[210*Range[250],And@@PrimeQ[#+{1,-1}]&]-1 (* _Harvey P. Dale_, Aug 25 2013 *) %o A060230 (GAP) P:=Filtered([1..10^7], IsPrime);; %o A060230 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 210 = 0), k -> k[1]); # _Muniru A Asiru_, Jan 29 2018 %o A060230 (PARI) is(n)=(n+1)%210==0 && isprime(n+2) && isprime(n) \\ _Charles R Greathouse IV_, Jan 29 2018 %Y A060230 A001359, A002110, A060229, A060231. %K A060230 nonn %O A060230 1,1 %A A060230 _Labos Elemer_, Mar 21 2001 %E A060230 Minor edits by _Ray Chandler_, Apr 02 2009