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 A269421 #8 Jan 17 2019 15:55:02 %S A269421 3,19,179,379,691,1187,1307,4787,15467,22307,43067,83579,273323, %T A269421 373459,1543291,5364091,5768803,20941259,137649667,251522291, %U A269421 369352163,426008699,938378747,1042908091,1378014731,1878780427,11474650339,12402606331,15931938899,51025309339,144309631099 %N A269421 Primes 8k + 3 preceding the maximal gaps in A269420. %C A269421 Subsequence of A007520. %C A269421 A269420 lists the corresponding record gap sizes. See more comments there. %H A269421 Alexei Kourbatov and Marek Wolf, <a href="https://arxiv.org/abs/1901.03785">Predicting maximal gaps in sets of primes</a>, arXiv preprint arXiv:1901.03785 [math.NT], 2019. %e A269421 The first two primes of the form 8k + 3 are 3 and 11, so a(1)=3. The next prime of this form is 19; the gap 19-11 is not a record so nothing is added to the sequence. The next prime of this form is 43 and the gap 43-19=24 is a new record, so a(2)=19. %o A269421 (PARI) re=0; s=3; forprime(p=11, 1e8, if(p%8!=3, next); g=p-s; if(g>re, re=g; print1(s", ")); s=p) %Y A269421 Cf. A007520, A269420, A269422. %K A269421 nonn %O A269421 1,1 %A A269421 _Alexei Kourbatov_, Feb 25 2016