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 A055770 #19 Jun 05 2020 03:11:44
%S A055770 1,2,1,2,1,6,1,2,1,2,1,6,1,2,1,2,1,6,1,2,1,2,1,24,1,2,1,2,1,6,1,2,1,2,
%T A055770 1,6,1,2,1,2,1,6,1,2,1,2,1,24,1,2,1,2,1,6,1,2,1,2,1,6,1,2,1,2,1,6,1,2,
%U A055770 1,2,1,24,1,2,1,2,1,6,1,2,1,2,1,6,1,2,1,2,1,6,1,2,1,2,1,24,1,2,1,2,1,6
%N A055770 Largest factorial number which divides n.
%C A055770 Largest m! which divides n.
%H A055770 Antti Karttunen, <a href="/A055770/b055770.txt">Table of n, a(n) for n = 1..10080</a>
%H A055770 Tyler Ball, Joanne Beckford, Paul Dalenberg, Tom Edgar, Tina Rajabi, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL23/Edgar/edgar3.html">Some Combinatorics of Factorial Base Representations</a>, J. Int. Seq., Vol. 23 (2020), Article 20.3.3.
%F A055770 a(n) = A000142(A055881(n)). - _Antti Karttunen_, Dec 19 2018
%e A055770 3! = 6 divides 12, so a(12) = 6.
%t A055770 With[{rf=Reverse[Range[7]!]},Table[SelectFirst[rf,Divisible[n,#]&],{n,120}]] (* Requires Mathematica version 10 or later *) (* _Harvey P. Dale_, Nov 05 2017 *)
%o A055770 (PARI) A055770(n) = { my(m=1, i=2); while(!(n%m), m *= i; i++); return(m/(i-1)); } \\ _Antti Karttunen_, Dec 19 2018
%Y A055770 Cf. A000142, A055881 (values of the m's), A055926, A055874, A073575.
%Y A055770 Cf. also A053589.
%K A055770 nonn,easy
%O A055770 1,2
%A A055770 _Labos Elemer_, Jul 12 2000
%E A055770 Name changed, old name moved to comments by _Antti Karttunen_, Dec 19 2018