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 A185941 #16 Jan 26 2024 16:52:00
%S A185941 251,1493,1889,1901,2393,2399,4373,4391,4451,4673,4679,5237,5351,5381,
%T A185941 6311,7079,7103,7793,7817,7823,7883,8111,9203,9209,9467,9473,9833,
%U A185941 10181,11393,11783,11789,12113,12641,12647,12653,12923,13103,13451,14741,15749
%N A185941 First of a run of 4 or more consecutive primes which all equal 2 (mod 3).
%C A185941 Subsequence of terms of A185938 such that A185938(k+1) = nextprime(A185938(k)).
%H A185941 G. C. Greubel, <a href="/A185941/b185941.txt">Table of n, a(n) for n = 1..5000</a>
%t A185941 pr6Q[l_]:=And@@(Mod[#,3]==2&/@l)
%t A185941 Transpose[Select[Partition[Prime[Range[2000]],4,1],pr6Q]][[1]] (* _Harvey P. Dale_, Feb 13 2011 *)
%t A185941 Prime[#]&/@(SequencePosition[Mod[#,3]&/@Prime[Range[2000]],{2,2,2,2}][[;;,1]]) (* _Harvey P. Dale_, Jan 26 2024 *)
%o A185941 (PARI) s=Mod([1,1,1,1]*2,3);o=vector(#s);i=0;forprime(p=1,1e4,o[i++%#o+1]=p;o-s|print1(o[(i+1)%#o+1]","))
%Y A185941 Cf. A185938.
%K A185941 nonn
%O A185941 1,1
%A A185941 _M. F. Hasler_, Feb 06 2011