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 A113729 #13 May 07 2015 18:15:54
%S A113729 5,8,8,10,16,20,24,24,28,36,36,40,48,48,56,56,60,72,72,72,80,90,90,98,
%T A113729 100,104,110,120,110,120,132,144,140,144,154,160,160,176,168,180,182,
%U A113729 192,192,198,208,224,216,230,228,240,234,252,242,252,266,266,276,276
%N A113729 a(n) is the integer between p(n) and p(n+3) which is divisible by (p(n+3)-p(n)), where p(n) is the n-th prime.
%C A113729 Exactly one integer exists between each p(n+3) and p(n) which is divisible by (p(n+3)-p(n)).
%H A113729 Harvey P. Dale, <a href="/A113729/b113729.txt">Table of n, a(n) for n = 1..1000</a>
%F A113729 a(n)=p(n+3) - (p(n) (mod p(n+3)-p(n))).
%e A113729 Between the primes 19 and 31 is the composite 24 and 24 is divisible by (31-19)=12. So 24 is in the sequence.
%t A113729 f[n_] := Block[{p = Prime[n], q = Prime[n + 3]}, q - Mod[p, q - p]]; Table[ f[n], {n, 58}] (* _Robert G. Wilson v_ *)
%t A113729 id[{a_,b_,c_,d_}]:=Select[Range[a+1,d-1],Divisible[#,d-a]&]; Flatten[ id/@ Partition[Prime[Range[70]],4,1]] (* _Harvey P. Dale_, May 07 2015 *)
%Y A113729 Cf. A113709, A113728.
%K A113729 nonn
%O A113729 1,1
%A A113729 _Leroy Quet_, Nov 08 2005
%E A113729 More terms from _Robert G. Wilson v_, Nov 09 2005