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 A078852 #21 Jul 29 2017 19:09:30
%S A078852 43,163,643,937,967,1093,1213,2953,4003,4447,6967,7573,8737,9463,
%T A078852 10243,10597,11923,12487,12637,13033,14533,14737,15787,16087,16417,
%U A078852 16477,16927,17317,17467,20113,22063,25453,26683,26713,27763,29863,32983
%N A078852 Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d=2,4 or 6) and forming d-pattern=[4, 6,6]; short d-string notation of pattern = [466].
%C A078852 Subsequence of A078561. - _R. J. Mathar_, Feb 11 2013
%H A078852 R. J. Mathar, <a href="/A078852/b078852.txt">Table of n, a(n) for n = 1..1000</a>
%F A078852 Primes p = p(i) such that p(i+1)=p+4, p(i+2)=p+4+6, p(i+3)=p+4+6+6.
%e A078852 p=43,43+4=47,43+4+6=53,43+4+6+6=59 are consecutive primes.
%t A078852 Transpose[Select[Partition[Prime[Range[4000]],4,1],Differences[#]=={4,6,6}&]][[1]] (* _Harvey P. Dale_, Dec 15 2015 *)
%o A078852 (PARI) isok(n) = isprime(n) && (nextprime(n+1) == (n+4)) && (nextprime(n+5) == (n+10)) && (nextprime(n+11) == (n+16)) \\ _Michel Marcus_, Jul 23 2013
%Y A078852 Cf. analogous prime quadruple sequences with various possible {2, 4, 6}-difference-patterns in brackets: A007530[242], A078847[246], A078848[264], A078849[266], A052378[424], A078850[426], A078851[462], A078852[466], A078853[624], A078854[626], A078855[642], A078856[646], A078857[662], A078858[664], A033451[666].
%K A078852 nonn
%O A078852 1,1
%A A078852 _Labos Elemer_, Dec 11 2002
%E A078852 Listed terms verified by _Ray Chandler_, Apr 20 2009