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 A248769 #6 Mar 13 2015 18:48:15 %S A248769 1,2,6,24,120,720,5040,1260,11340,113400,1247400,1925,25025,350350, %T A248769 5255250,2627625,44669625,804053250,15277011750,305540235000, %U A248769 6416344935000,141159588570000,3246670537110000,10020588077500,80164704620,2084282320120,56275622643240 %N A248769 Greatest 5th-power-free divisor of n!. %H A248769 Clark Kimberling, <a href="/A248769/b248769.txt">Table of n, a(n) for n = 1..1000</a> %F A248769 a(n) = n!/A248767(n). %e A248769 a(8) = 1260 because 1260 divides 8! and if k > 1260 divides 8!, then h^5 divides 8!/k for some h > 1. %t A248769 z = 50; f[n_] := f[n] = FactorInteger[n!]; r[m_, x_] := r[m, x] = m*Floor[x/m]; %t A248769 u[n_] := Table[f[n][[i, 1]], {i, 1, Length[f[n]]}]; %t A248769 v[n_] := Table[f[n][[i, 2]], {i, 1, Length[f[n]]}]; %t A248769 p[m_, n_] := p[m, n] = Product[u[n][[i]]^r[m, v[n]][[i]], {i, 1, Length[f[n]]}]; %t A248769 m = 5; Table[p[m, n], {n, 1, z}] (* A248767 *) %t A248769 Table[p[m, n]^(1/m), {n, 1, z}] (* A248768 *) %t A248769 Table[n!/p[m, n], {n, 1, z}] (* A248769 *) %Y A248769 Cf. A248767, A248768, A000142. %K A248769 nonn,easy %O A248769 1,2 %A A248769 _Clark Kimberling_, Oct 14 2014