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 A085085 #12 Sep 07 2018 04:41:00
%S A085085 0,1,2,2,4,5,6,3,4,7,10,10,12,9,14,4,16,4,18,17,16,13,22,25,8,15,6,19,
%T A085085 28,68,30,5,20,19,42,14,36,21,22,51,40,31,42,23,92,25,46,5,12,6,26,25,
%U A085085 52,11,46,79,28,31,58,157,60,33,146,6,48,35,66,29,32,218,70,131,72,39,22,31,88
%N A085085 Numerator of Sum_{i=2..t} (d(i)/d(i-1)-1), where d(1), ..., d(t) are the divisors of n.
%H A085085 Antti Karttunen, <a href="/A085085/b085085.txt">Table of n, a(n) for n = 1..65537</a>
%H A085085 M. D. Vose, <a href="http://dx.doi.org/10.1016/0022-314X(84)90107-0">Integers with consecutive divisors in small ratio</a>, J. Number Theory, 19 (1984), 233-238.
%e A085085 0, 1, 2, 2, 4, 5/2, 6, 3, 4, 7/2, 10, 10/3, 12, 9/2, 14/3, ...
%p A085085 with(numtheory): f := proc(n) local t1,t2,t3,i; t1 := divisors(n); t3 := convert(t1,list); t2 := 0; for i from 2 to nops(t3) do t2 := t2+(t3[i]/t3[i-1]-1); od; t2; end;
%o A085085 (PARI) a(n) = {my(d = divisors(n)); numerator(sum(i=2, #d, d[i]/d[i-1] - 1));} \\ _Michel Marcus_, Feb 25 2015
%Y A085085 Cf. A085091.
%K A085085 nonn,frac
%O A085085 1,3
%A A085085 _N. J. A. Sloane_, Aug 11 2003