%I A070172
%S A070172 1,2,2,3,4,4,4,6,6,6,6,6,8,8,8,10,10,10,12,12,12,12,12,12,12,12,12,12,
%T A070172 16,16,16,18,18,18,18,18,18,18,18,20,20,20,24,24,24,24,24,24,24,24,24,
%U A070172 24,24,24,24,24,24,24,24,24,30,30,30,30,30,30,30,30,30,30,30,30,36,36
%N A070172 Smallest k such that sigma(k)=>n.
%C A070172 Also smallest m to partition n into distinct divisors of m; hihgly abundant 
               numbers are record values: a(i)<A002093(n) for 1<=i<A085443(n), A002093(n)=a(A085443(n)). 
               - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jun 30 2003
%F A070172 It seems that lim n -> infinity a(n)/n*ln(ln(n))=C=0, 6...
%o A070172 (PARI) for(n=1,150,s=1; while(sigma(s)<n,s++); print1(s,","))
%Y A070172 Sequence in context: A006165 A131807 A104351 this_sequence A130128 A049980 
               A141525
%Y A070172 Adjacent sequences: A070169 A070170 A070171 this_sequence A070173 A070174 
               A070175
%K A070172 easy,nonn
%O A070172 1,2
%A A070172 Benoit Cloitre (benoit7848c(AT)orange.fr), May 06 2002