cp's OEIS Frontend

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.

A248768 Greatest k such that k^5 divides n!

This page as a plain text file.
%I A248768 #4 Oct 19 2014 16:24:14
%S A248768 1,1,1,1,1,1,1,2,2,2,2,12,12,12,12,24,24,24,24,24,24,24,24,144,720,
%T A248768 720,720,1440,1440,1440,1440,2880,8640,8640,60480,60480,60480,120960,
%U A248768 120960,120960,120960,120960,120960,241920,3628800,3628800,3628800,7257600
%N A248768 Greatest k such that k^5 divides n!
%C A248768 Every term divides all its successors.
%H A248768 Clark Kimberling, <a href="/A248768/b248768.txt">Table of n, a(n) for n = 1..1000</a>
%e A248768 a(8) = 2 because 2^5 divides 8! and if k > 2 then k^5 does not divide 8!.
%t A248768 z = 50; f[n_] := f[n] = FactorInteger[n!]; r[m_, x_] := r[m, x] = m*Floor[x/m];
%t A248768 u[n_] := Table[f[n][[i, 1]], {i, 1, Length[f[n]]}];
%t A248768 v[n_] := Table[f[n][[i, 2]], {i, 1, Length[f[n]]}];
%t A248768 p[m_, n_] := p[m, n] = Product[u[n][[i]]^r[m, v[n]][[i]], {i, 1, Length[f[n]]}];
%t A248768 m = 5; Table[p[m, n], {n, 1, z}]  (* A248767 *)
%t A248768 Table[p[m, n]^(1/m), {n, 1, z}]   (* A248768 *)
%t A248768 Table[n!/p[m, n], {n, 1, z}]      (* A248769 *)
%Y A248768 Cf. A248767, A248769, A000142.
%K A248768 nonn,easy
%O A248768 1,8
%A A248768 _Clark Kimberling_, Oct 14 2014