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 A269521 #11 Jan 18 2019 04:45:07 %S A269521 23,71,311,359,599,6551,37423,42703,66751,183823,259583,308263,471391, %T A269521 1071023,1801727,5904247,6886367,16936991,22414079,38821039,63978127, %U A269521 84165271,147453599,150335431,239423519,300412927,387155903,473154943,539527199,760401839,788129191 %N A269521 Primes 8k + 7 at the end of the maximal gaps in A269519. %C A269521 Subsequence of A007522. %C A269521 A269519 lists the corresponding record gap sizes. See more comments there. %H A269521 Alexei Kourbatov, <a href="/A269521/b269521.txt">Table of n, a(n) for n = 1..39</a> %H A269521 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 A269521 The first two primes of the form 8k + 7 are 7 and 23, so a(1)=23. The next primes of this form are 31, 47; the gaps 31-23 and 47-31 are not records so nothing is added to the sequence. The next prime of this form is 71 and the gap 71-47=24 is a new record, so a(2)=71. %o A269521 (PARI) re=0; s=7; forprime(p=23, 1e8, if(p%8!=7, next); g=p-s; if(g>re, re=g; print1(p", ")); s=p) %Y A269521 Cf. A007522, A269519, A269520. %K A269521 nonn %O A269521 1,1 %A A269521 _Alexei Kourbatov_, Feb 28 2016