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 A036762 #16 Jul 05 2016 03:28:49
%S A036762 1,1,2,3,2,3,3,4,5,7,5,6,8,7,11,8,13,9,16,11,17,19,13,10,23,17,25,19,
%T A036762 29,12,31,14,23,16,37,41,43,29,15,31,47,24,22,53,49,37,32,25,26,59,20,
%U A036762 61,41,21,43,67,28,47,71,73,25,34,125,79,53,40,83,28,38,59
%N A036762 The integer values of x/d(x) in order of magnitude of x in A033950.
%H A036762 Nathaniel Johnston, <a href="/A036762/b036762.txt">Table of n, a(n) for n = 1..10000</a>
%e A036762 If n=63, then x=625 and d(x) = 5 divides x. The quotient is 125 = a(63).
%p A036762 with(numtheory): A033950 := proc(n) option remember: local k: if(n=1)then return 1: else k:=procname(n-1)+1: do if(type(k/tau(k),integer))then return k: fi: k:=k+1: od: fi: end: A036762 := proc(n) return A033950(n)/tau(A033950(n)): end: seq(A036762(n),n=1..70); # _Nathaniel Johnston_, May 04 2011
%t A036762 Select[Table[n/DivisorSigma[0, n], {n, 708}], IntegerQ] (* _Michael De Vlieger_, Jul 04 2016 *)
%Y A036762 Cf. A000005, A033950, A036761, A036763, A039819.
%K A036762 nonn,easy
%O A036762 1,3
%A A036762 _Labos Elemer_