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 A058193 #21 Mar 19 2025 08:27:53
%S A058193 23,199,523,1669,4297,9551,16141,28229,35617,43331,162143,31397,
%T A058193 188029,461717,404851,360653,1444309,2238823,492113,1895359,1671781,
%U A058193 1357201,3826019,11981443,13626257,17983717,39175217,37305713,52721113
%N A058193 Smallest prime p such that there is a gap of 6n between p and the next prime.
%H A058193 Amiram Eldar, <a href="/A058193/b058193.txt">Table of n, a(n) for n = 1..240</a>
%H A058193 Thomas R. Nicely, <a href="https://faculty.lynchburg.edu/~nicely/gaps/gaplist.html">First occurrence prime gaps</a> [For local copy see A000101]
%H A058193 <a href="/index/Pri#gaps">Index entries for primes, gaps between</a>.
%F A058193 a(n) = A000230(3n).
%e A058193 d = 72 appears after 31397, while smaller d = 54, 60, 66 come later, following primes 35617, 43331, 162143, respectively.
%t A058193 Module[{nn=32*10^5,prs,gps},prs=Prime[Range[nn]];gps=Differences[prs];Table[SelectFirst[Thread[{Most[prs],gps}],#[[2]]==6n&],{n,30}]][[;;,1]] (* _Harvey P. Dale_, Mar 03 2025 *)
%o A058193 (PARI) a(n) = {p=3; q = nextprime(p+1); while((q-p) != 6*n, p = q; q = nextprime(q+1)); p;} \\ _Michel Marcus_, Mar 12 2016
%Y A058193 Cf. A101232, A062529, A000230.
%K A058193 nonn
%O A058193 1,1
%A A058193 _Labos Elemer_, Nov 28 2000
%E A058193 Offset corrected by _M. F. Hasler_, Apr 09 2013