%I A094268
%S A094268 0,12,5775,171078830
%N A094268 Starting term of smallest consecutive n-tuples of abundant numbers.
%C A094268 The triple 171078830, 171078832, 171078832 was apparently found by Laurent 
               Hodges and Michael Reid in 1975.
%C A094268 The starting term of the smallest consecutive 4-tuple of abundant numbers 
               is at most 141363708067871564084949719820472453374 - Bruno Mishutka 
               (bruno.mishutka(AT)googlemail.com), Nov 01 2007
%C A094268 Paul Erdos showed that there are two absolute constants c1, c2 such that 
               for all large n there are at least c1 log log log n but not more 
               than c2 log log log n consecutive abundant numbers less than n. - 
               Bruno Mishutka (bruno.mishutka(AT)googlemail.com), Nov 01 2007
%C A094268 The term a(0) = 0 is included to avoid the warning messages triggered 
               by sequences with fewer than four terms. - N. J. A. Sloane (njas(AT)research.att.com), 
               Nov 07 2007
%D A094268 J.-M. De Koninck and A. Mercier, 1001 Problemes en Theorie Classique 
               Des Nombres, Problem 771, pp. 98, 327, Ellipses, Paris, 2004.
%D A094268 Paul Erdos, "Note on consecutive abundant numbers", J. London Math. Soc. 
               10, 128-131 (1935).
%Y A094268 Cf. A005105, A005231.
%Y A094268 Sequence in context: A134821 A013508 A003793 this_sequence A012607 A167072 
               A107251
%Y A094268 Adjacent sequences: A094265 A094266 A094267 this_sequence A094269 A094270 
               A094271
%K A094268 hard,more,nonn
%O A094268 0,2
%A A094268 Lekraj Beedassy (blekraj(AT)yahoo.com), Jun 02 2004