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 A078960 #20 Feb 22 2025 03:42:17
%S A078960 593,4643,6353,11483,19463,34253,71333,77543,89513,101273,135593,
%T A078960 148853,179813,184823,191453,193373,245513,260003,267893,277883,
%U A078960 280583,302573,307253,308303,310223,344243,346433,350423,376463,408203,416393,435563,442823,450473,482393
%N A078960 Primes p such that the differences between the 5 consecutive primes starting with p are (6,2,6,6).
%C A078960 Equivalently, primes p such that p, p+6, p+8, p+14 and p+20 are consecutive primes.
%H A078960 Amiram Eldar, <a href="/A078960/b078960.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..1000 from Harvey P. Dale)
%F A078960 a(n) == 23 (mod 30). - _Amiram Eldar_, Feb 22 2025
%e A078960 593 is in the sequence since 593, 599 = 593 + 6, 601 = 593 + 8, 607 = 593 + 14 and 613 = 593 + 20 are consecutive primes.
%t A078960 Transpose[Select[Partition[Prime[Range[36000]],5,1],Differences[#]=={6,2,6,6}&]][[1]] (* _Harvey P. Dale_, Oct 14 2013 *)
%o A078960 (PARI) list(lim) = {my(p1 = 2, p2 = 3, p3 = 5, p4 = 7); forprime(p5 = 11, lim, if(p2 - p1 == 6 && p3 - p2 == 2 && p4 - p3 == 6 && p5 - p4 == 6, print1(p1, ", ")); p1 = p2; p2 = p3; p3 = p4; p4 = p5);} \\ _Amiram Eldar_, Feb 22 2025
%Y A078960 Subsequence of A078854. - _R. J. Mathar_, May 06 2017
%Y A078960 Cf. A001223, A078866, A078867, A078946-A078971, A022006, A022007.
%K A078960 nonn
%O A078960 1,1
%A A078960 _Labos Elemer_, Dec 19 2002
%E A078960 Edited by _Dean Hickerson_, Dec 20 2002