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 A224522 #13 Jul 23 2025 05:10:07 %S A224522 4297,43331,404851,1895359,13626257,17051707,20831323,391995431, %T A224522 1391048047,4758958741,6291356009,20068818197,53241805651,82490815123, %U A224522 63816175447,482423533897,2209016910131,738832927927,4442109925217,4872634110067,12644461143649,10653514291843,15712145060693,111113196467011 %N A224522 Least prime which is followed by a gap of 30n. %C A224522 Data up to 2e9 computed independently and (up to 391995431) double-checked with A140791. Data beyond 2e9 taken from Nicely's web page (which would yield further terms, at least up to a(47) - notice that the "?" in column 10, e.g. for gap 1440, indicates that the listed values is the first *known*, but maybe not the first occurrence). See there for credits. %H A224522 Thomas R. Nicely, <a href="https://faculty.lynchburg.edu/~nicely/gaps/gaplist.html">First occurrence prime gaps</a> [For local copy see A000101] %H A224522 <a href="/index/Pri#gaps">Index entries for primes, gaps between</a>. %F A224522 a(n) = A000230(15n) = A058193(5n) = A140791(3n) %o A224522 (PARI) o=2;g=30;forprime(p=3,,(o+g != o=p) & next; print1(p-g",");g+=30) \\ Warning: this code assumes that the sequence is increasing, which may not be the case. - _M. F. Hasler_, Apr 09 2013 %K A224522 nonn,hard %O A224522 1,1 %A A224522 _M. F. Hasler_, Apr 09 2013