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 A275014 #35 Apr 25 2020 08:43:22
%S A275014 3,9,29,101,247,2531,16033,26615,39359,104677,248426,506531,584237,
%T A275014 2560202,4036993,4417843,5167619,9725141,25045807,27489719,70416301,
%U A275014 111555415,174266734,359589619,1075714987,6820213399,15378035231,16598109538,19423306117,30133946758,74466436127
%N A275014 Upper ends of record gaps between numbers that are either primes or semiprimes.
%C A275014 This sequence is infinite, since the asymptotic density of the primes and semiprimes is 0. - _Charles R Greathouse IV_, Nov 12 2016
%H A275014 Giovanni Resta, <a href="/A275014/b275014.txt">Table of n, a(n) for n = 1..37</a> (terms < 10^13)
%F A275014 a(n) = A275013(n) + A275108(n).
%e A275014 a(5) = 247 because the next prime or semiprime after 241 is 247, and that is a record gap of size 6.
%o A275014 (PARI) r=0; last=2; for(n=3, 1e9, if(bigomega(n)<3, if(n-last>r, r=n-last; print1(n", ")); last=n)) \\ _Charles R Greathouse IV_, Nov 12 2016
%o A275014 (PARI) checkrange(a, b, r)=while(b-a>r, forstep(n=a+r, a+1, -1, if(bigomega(n)<3, a=n; next(2))); for(n=a+r+1, b, if(bigomega(n)<3, return([a, n])))); 0
%o A275014 print1(3); p=5; r=1; forprime(q=7, 1e9, if(q-p<=r, p=q; next); t=checkrange(p, q, r); while(t!=0, print1(", "t[2]); t=checkrange(t[2], q, r=t[2]-t[1])); p=q) \\ _Charles R Greathouse IV_, Nov 12 2016
%Y A275014 Cf. A037143, A111087, A275013, A275108.
%K A275014 nonn
%O A275014 1,1
%A A275014 _Bobby Jacobs_, Nov 12 2016
%E A275014 a(7)-a(31) from _Charles R Greathouse IV_, Nov 12 2016