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 A254033 #19 Jun 13 2018 03:27:17
%S A254033 0,1,2,3,6,10,15,20,21,28,37,44,53,76,96,113,123,135,142,150,181,191,
%T A254033 235,270,291,294,313,327,334,395,403,411,445,478,496,539,582,587,654,
%U A254033 693,722,732,757,754,772,778,791,832,830,848,920,930,955,1004,1053,1151,1240
%N A254033 Number of primes dividing exactly one number in the next largest gap between primes.
%H A254033 Robert G. Wilson v, <a href="/A254033/b254033.txt">Table of n, a(n) for n = 1..75</a>
%e A254033 The 5th largest prime gap (after 2-3, 3-5, 7-11 and 23-29) occurs between 89 and 97, and there are 6 primes which occur exactly once in this gap, namely 7 (dividing 91), 13 (dividing 91), 19 (dividing 95), 23 (dividing 92), 31 (dividing 93) and 47 (dividing 94), so a(5)=6.
%t A254033 gp = (* the list of primes in A002386 *); f[n_] := Block[{p = gp[[n]], q = NextPrime[ gp[[n]]]}, r = Range[p + 1, q - 1]; lng = Length@ r; t = Split@ Sort@ Flatten@ Table[ First@# & /@ FactorInteger[ r[[i]]], {i, lng}]; Length@ Select[t, Length@# == 1 &]]; Array[f, 75] (* _Robert G. Wilson v_, Jan 23 2015 *)
%Y A254033 Sequences related to increasing prime gaps: A005250, A002386, A000101, A005669.
%K A254033 nonn
%O A254033 1,3
%A A254033 _Mamuka Jibladze_, Jan 23 2015
%E A254033 a(43)-a(57) from _Robert G. Wilson v_, Jan 23 2015