|
| |
|
|
A051904
|
|
Minimal exponent in prime factorization of n.
|
|
26
| |
|
|
0, 1, 1, 2, 1, 1, 1, 3, 2, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 3, 1, 1, 1, 1, 5, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 6, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,4
|
|
|
LINKS
| Daniel Forgues, Table of n, a(n) for n=1..100000
Eric Weisstein's World of Mathematics, Niven's Constant
|
|
|
FORMULA
| a(n) = min(k=1..A001221(n), A124010(n,k) ). [Reinhard Zumkeller, Aug 27 2011]
|
|
|
EXAMPLE
| For n = 72 = 2^3*3^2, a(72) = min(exponents) = min(3,2) = 2.
|
|
|
MATHEMATICA
| Table[If[n == 1, 0, Min @@ Last /@ FactorInteger[n]], {n, 100}] (*Chandler*)
|
|
|
CROSSREFS
| Cf. A005361, A008479, A051903, A052409.
Sequence in context: A158052 A158378 A052409 * A070012 A071178 A072776
Adjacent sequences: A051901 A051902 A051903 * A051905 A051906 A051907
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| Labos E. (labos(AT)ana.sote.hu), Dec 16 1999
|
| |
|
|
