|
Search: id:A094634
|
|
| |
|
| 1, 3, 4, 5, 4, 5, 5, 2, 6, 7, 5, 6, 6, 7, 7, 6, 7, 7, 7, 6, 7, 7, 7, 8, 8, 7, 8, 8, 8, 7, 8, 8, 8, 9, 9, 8, 9, 9, 8, 9, 9, 9, 10, 9, 8, 9, 9, 9, 10, 9, 10, 10, 9, 2, 10, 10, 9, 10, 10, 10, 11, 10, 11, 9, 10, 10, 10, 11, 10, 11, 11, 10, 11, 11, 10, 11, 11, 11, 11, 10, 11, 11, 11, 11, 12, 11, 10
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
When a(n)=2, A094404(n) is not 1.
|
|
MATHEMATICA
|
Smarandache[1] := 1; Smarandache[n_] := Max[Smarandache @@@ FactorInteger[n]]; Smarandache[p_, 1] := p; Smarandache[p_, alpha_] := Smarandache[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 = 2; Do[ s = Smarandache[n]; If[s/n < a, a = s/n; AppendTo[M, a]; AppendTo[L, n]], {n, 2, 40320}], L/Denominator[M] (revised by EWW May 17 2004)
|
|
CROSSREFS
|
Cf. A094371, A094372.
Sequence in context: A014250 A155078 A115051 this_sequence A114545 A161386 A085600
Adjacent sequences: A094631 A094632 A094633 this_sequence A094635 A094636 A094637
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Jonathan Sondow (jsondow(AT)alumni.princeton.edu) and Robert G. Wilson v (rgwv(AT)rgwv.com), May 17 2004
|
|
|
Search completed in 0.002 seconds
|
