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 A211073 #18 Mar 25 2016 11:30:27 %S A211073 2,3,5,7,13,23,31,113,1327,19609,25471,31397,34061,43331,44293,155921, %T A211073 188029,212701,265621,338033,360653,370261,396733,404851,492113, %U A211073 544279,576791,604073,838249,860143,1098847,1139993,1313467,1349533,1357201,1388483,1444309 %N A211073 Primes p followed by a gap of at least 1/2 * log(p)^2. %C A211073 Primes followed by unusually long prime gaps. %C A211073 The Cramér model suggests that there are about 2*sqrt(x/log^2 x) elements up to x. - _Charles R Greathouse IV_, Mar 18 2016 %H A211073 Charles R Greathouse IV, <a href="/A211073/b211073.txt">Table of n, a(n) for n = 1..10000</a> %F A211073 Primes p such that all integers in (p, p + 0.5 * log(p)^2) are composite. %t A211073 Select[Prime[Range[10^4]], NextPrime[#] - # > (Log[#]^2)/2 &] (* _Alonso del Arte_, Jun 02 2013 *) %o A211073 (PARI) G=1; p=2; forprime(q=3, 1e7, if(q-p>=G && q-p>log(p)^2/2, G=ceil(log(p)^2/2); print1(p", ")); p=q) %Y A211073 Cf. A002386, A082885, A111943, A182315. %K A211073 nonn %O A211073 1,1 %A A211073 _Charles R Greathouse IV_, Apr 26 2012