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 A074093 #16 Feb 06 2019 17:19:10
%S A074093 1,2,1,2,1,3,1,1,1,3,1,2,1,2,1,2,1,3,1,2,1,3,1,1,1,2,1,3,1,3,1,1,1,2,
%T A074093 1,2,1,2,1,2,1,4,1,2,1,3,1,1,1,2,1,3,1,2,1,1,1,3,1,2,1,2,1,1,1,4,1,2,
%U A074093 1,3,1,2,1,2,1,2,1,4,1,1,1,3,1,1,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,3,1,4,1,1,1
%N A074093 Number of values of k such that n = k - largest divisor of k (<k).
%H A074093 Antti Karttunen, <a href="/A074093/b074093.txt">Table of n, a(n) for n = 1..100000</a>
%F A074093 a(2n+1)=1; sum(k=1, n, a(k)) seems to be asymptotic to C*n with C=1.6... - _Benoit Cloitre_, Aug 21 2002
%e A074093 a(6) = 3 and the three values of k are 7,9 and 12.
%t A074093 f1[n_] := Count[Range[n, 2 n], _?(Differences[Take[Divisors[#], -2]] == {n} &)]; Join[{1}, Table[f1[n], {n, 2, 105}]] (* _Jayanta Basu_, Jul 30 2013 *)
%o A074093 (PARI) a(n)=sum(k=2,2*n,if(k- component(divisors(k),numdiv(k)-1)-n,0,1))
%Y A074093 Cf. A073932, A073933, A073934, A073935, A060681.
%K A074093 nonn
%O A074093 1,2
%A A074093 _Amarnath Murthy_, Aug 19 2002
%E A074093 More terms from _Benoit Cloitre_ and _Vladeta Jovovic_, Aug 21 2002