Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #25 Aug 02 2024 19:14:47
%S 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 28,28,28,30,30,36,36,36,36,36,36,40,40,40,40,42,42,46,46,46,46,52,52,
%U 52,52,52,52,58,58,58,58,58,58,60,60,66,66,66,66,66,66,70,70,70,70,72
%N Largest m such that 1..m all divide n!.
%C Also the largest m such that 1!..m! all divide 2*A297707(n). - _Lechoslaw Ratajczak_, Apr 23 2019
%H Harry J. Smith, <a href="/A064778/b064778.txt">Table of n, a(n) for n = 1..1000</a>
%F a(n) = A151800(n) - 1 for n != 3. - _David A. Corneth_, Apr 23 2019
%t Do[ m = 1; While[ IntegerQ[n!/m], m++ ]; Print[m - 1], {n, 1, 100} ]
%t Table[Position[Divisible[n!,Range[100]],False,1,1][[1]]-1,{n,80}]//Flatten (* _Harvey P. Dale_, Aug 02 2024 *)
%o (PARI) { m=2; for (n=1, 1000, while (n!%m == 0, m++); write("b064778.txt", n, " ", m - 1) ) } \\ _Harry J. Smith_, Sep 24 2009
%Y Cf. A002034, A151800, A297707.
%K easy,nonn
%O 1,2
%A _Robert G. Wilson v_, Oct 18 2001