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 A064778 #25 Aug 02 2024 19:14:47
%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!.
%C A064778 Also the largest m such that 1!..m! all divide 2*A297707(n). - _Lechoslaw Ratajczak_, Apr 23 2019
%H A064778 Harry J. Smith, <a href="/A064778/b064778.txt">Table of n, a(n) for n = 1..1000</a>
%F A064778 a(n) = A151800(n) - 1 for n != 3. - _David A. Corneth_, Apr 23 2019
%t A064778 Do[ m = 1; While[ IntegerQ[n!/m], m++ ]; Print[m - 1], {n, 1, 100} ]
%t A064778 Table[Position[Divisible[n!,Range[100]],False,1,1][[1]]-1,{n,80}]//Flatten (* _Harvey P. Dale_, Aug 02 2024 *)
%o A064778 (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 A064778 Cf. A002034, A151800, A297707.
%K A064778 easy,nonn
%O A064778 1,2
%A A064778 _Robert G. Wilson v_, Oct 18 2001