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 A217659 #11 Apr 12 2025 03:48:14
%S A217659 37,67,79,157,163,211,223,277,337,373,379,439,541,547,577,607,613,631,
%T A217659 673,733,739,757,997,1009,1039,1069,1087,1123,1129,1213,1237,1249,
%U A217659 1297,1327,1399,1459,1471,1543,1549,1627,1663,1693,1747,1753,1759,1777,1783
%N A217659 Larger of two consecutive primes which both equal 1 (mod 3).
%H A217659 Reinhard Zumkeller, <a href="/A217659/b217659.txt">Table of n, a(n) for n = 1..1000</a>
%F A217659 a(n) = A151800(A185934(n)) = 6*A219244(n) + A185934(n).
%t A217659 With[{p = Prime[Range[350]]}, ind = Position[Mod[p, 3], 1] // Flatten; p[[1 + ind[[Position[Differences[ind], 1] // Flatten]]]]] (* _Amiram Eldar_, Apr 12 2025 *)
%o A217659 (Haskell)
%o A217659 a217659 = a151800 . fromInteger . a185934
%Y A217659 Cf. A002476, A151800, A185934, A219244.
%K A217659 nonn
%O A217659 1,1
%A A217659 _Reinhard Zumkeller_, Nov 16 2012