%I A064778
%S A064778 1,2,3,4,6,6,10,10,10,10,12,12,16,16,16,16,18,18,22,22,22,22,28,28,28,
%T A064778 28,28,28,30,30,36,36,36,36,36,36,40,40,40,40,42,42,46,46,46,46,52,52,
%U A064778 52,52,52,52,58,58,58,58,58,58,60,60,66,66,66,66,66,66,70,70,70,70,72
%N A064778 Largest m such that 1..m all divide n!
%H A064778 Harry J. Smith, <a href="b064778.txt">Table of n, a(n) for n=1,...,1000</
               a>
%t A064778 Do[ m = 1; While[ IntegerQ[n!/m], m++ ]; Print[m - 1], {n, 1, 100} ]
%o A064778 (PARI) { m=2; for (n=1, 1000, while (n!%m == 0, m++); write("b064778.txt", 
               n, " ", m - 1) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), 
               Sep 24 2009]
%Y A064778 Cf. A002034.
%Y A064778 Sequence in context: A006874 A034890 A009490 this_sequence A028335 A007464 
               A064764
%Y A064778 Adjacent sequences: A064775 A064776 A064777 this_sequence A064779 A064780 
               A064781
%K A064778 easy,nonn
%O A064778 1,2
%A A064778 Robert G. Wilson v (rgwv(AT)rgwv.com), Oct 18 2001