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 A078561 #20 Mar 24 2018 17:32:54
%S A078561 19,43,79,127,163,229,349,379,439,499,643,673,937,967,1009,1093,1213,
%T A078561 1279,1429,1489,1549,1597,1609,2203,2347,2389,2437,2539,2689,2833,
%U A078561 2953,3079,3319,3529,3613,3793,3907,3919,4003,4129,4447,4639,4789,4933,4999
%N A078561 p, p+4 and p+10 are consecutive primes.
%C A078561 Subsequence of A029710. - _R. J. Mathar_, May 06 2017
%H A078561 R. J. Mathar, <a href="/A078561/b078561.txt">Table of n, a(n) for n = 1..1000</a>
%e A078561 Between p and p+10 [46] difference-pattern: 19(4)23(6)29;
%t A078561 Select[Prime@ Range[10^3], Differences@ NestList[NextPrime, #, 2] == {4, 6} &] (* _Michael De Vlieger_, May 06 2017 *)
%t A078561 Select[Partition[Prime[Range[700]],3,1],Differences[#]=={4,6}&][[All,1]] (* _Harvey P. Dale_, Mar 24 2018 *)
%o A078561 (PARI) isok(p) = isprime(p) && (nextprime(p+1) == p+4) && (nextprime(p+5) == p+10); \\ _Michel Marcus_, Dec 20 2013
%o A078561 (PARI) is(n)=isprime(n) && isprime(n+4) && isprime(n+10) && !isprime(n+6) && n>3 \\ _Charles R Greathouse IV_, Dec 20 2013
%Y A078561 Cf. analogous inter-prime d-patterns with d<=6: A022004[24], A022005[42], A049437[26], A049438[62], A078561[46], A078562[64], A047948[66].
%K A078561 nonn
%O A078561 1,1
%A A078561 _Labos Elemer_, Dec 10 2002