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 A078967 #20 Feb 22 2025 03:36:01
%S A078967 151,367,3307,4987,20101,30097,52951,53617,85831,92221,95701,99817,
%T A078967 103561,128461,135601,163621,214651,221071,241321,241861,246907,
%U A078967 274831,280591,282691,287851,294787,295831,297601,307261,308311,334771,340897,347161,350431,354301
%N A078967 Primes p such that the differences between the 5 consecutive primes starting with p are (6,6,4,6).
%C A078967 Equivalently, primes p such that p, p+6, p+12, p+16 and p+22 are consecutive primes.
%H A078967 Amiram Eldar, <a href="/A078967/b078967.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..1000 from Harvey P. Dale)
%F A078967 From _Amiram Eldar_, Feb 22 2025: (Start)
%F A078967 a(n) == 1 (mod 6).
%F A078967 a(n) == 1 or 7 (mod 30). (End)
%e A078967 151 is in the sequence since 151, 157 = 151 + 6, 163 = 151 + 12, 167 = 151 + 16 and 173 = 151 + 22 are consecutive primes.
%t A078967 Transpose[Select[Partition[Prime[Range[30000]],5,1],Differences[#] == {6,6,4,6}&]][[1]] (* _Harvey P. Dale_, Apr 06 2012 *)
%o A078967 (PARI) list(lim) = {my(p1 = 2, p2 = 3, p3 = 5, p4 = 7); forprime(p5 = 11, lim, if(p2 - p1 == 6 && p3 - p2 == 6 && p4 - p3 == 4 && p5 - p4 == 6, print1(p1, ", ")); p1 = p2; p2 = p3; p3 = p4; p4 = p5);} \\ _Amiram Eldar_, Feb 22 2025
%Y A078967 Subsequence of A078858. - _R. J. Mathar_, May 06 2017
%Y A078967 Cf. A001223, A078866, A078867, A078946-A078971, A022006, A022007.
%K A078967 nonn
%O A078967 1,1
%A A078967 _Labos Elemer_, Dec 19 2002
%E A078967 Edited by _Dean Hickerson_, Dec 20 2002