OFFSET
1,2
COMMENTS
The factorials, where A002034(n!)/n! = 1/(n-1)!, appear to form a subsequence. The numbers A007672(a(n)) are small.
a(n) is either even, 19k, 23k or R*k, where R is a repunit prime. For example at 2.19.23=874, the corresponding repunit is divisible by 3 repunit primes. - Labos Elemer, Jun 04 2004
LINKS
A. J. Kempner, Miscellanea, Amer. Math. Monthly, 25 (1918), 201-210 [ See Section II, "Concerning the smallest integer m! divisible by a given integer n". ]
J. Sondow and E. W. Weisstein, MathWorld: Smarandache Function
EXAMPLE
The first 5 incrementally smallest ratios A002034(n)/n are 1, 1/2, 1/3, 1/4, 1/6. They occur at n = 1, 6, 12, 20, 24.
MATHEMATICA
(A002034[n_] := (m=1; While[ !IntegerQ[m!/n], m++ ]; m); M = {}; L = {}; Do[With[{s = A002034[n]}, If[s/n < Min[M], M = Append[M, s/n]; L = Append[L, n]]], {n, 100}]; L)
A002034[1] := 1; A002034[n_] := Max[A002034 @@@ FactorInteger[n]]; A002034[p_, 1] := p; A002034[p_, alpha_] := A002034[p, alpha] = Module[{a, k, r, i, nu, k0 = alpha(p - 1)}, i = nu = Floor[Log[p, 1 + k0]]; a[1] = 1; a[n_] := (p^n - 1)/(p - 1); k[nu] = Quotient[alpha, a[nu]]; r[nu] = alpha - k[nu]a[nu]; While[r[i] > 0, k[i - 1] = Quotient[r[i], a[i - 1]]; r[i - 1] = r[i] - k[i - 1]a[i - 1]; i-- ]; k0 + Plus @@ k /@ Range[i, nu]]; L = M = {}; a = 1; Do[ s = A002034[n], If[s/n < a, a = s/n; AppendTo[M, a]; AppendTo[L, n]]], {n, 40320}]; L (* Eric W. Weisstein, May 17 2004 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Jonathan Sondow, Apr 28 2004
EXTENSIONS
More terms from Robert G. Wilson v, May 15 2004
STATUS
approved