|
| |
|
|
A051903
|
|
Maximal exponent in prime factorization of n.
|
|
50
| |
|
|
0, 1, 1, 2, 1, 1, 1, 3, 2, 1, 1, 2, 1, 1, 1, 4, 1, 2, 1, 2, 1, 1, 1, 3, 2, 1, 3, 2, 1, 1, 1, 5, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 2, 2, 1, 1, 4, 2, 2, 1, 2, 1, 3, 1, 3, 1, 1, 1, 2, 1, 1, 2, 6, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 2, 2, 1, 1, 1, 4, 4, 1, 1, 2, 1, 1, 1, 3, 1, 2, 1, 2, 1, 1, 1, 5, 1, 2, 2, 2, 1, 1, 1, 3, 1
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,4
|
|
|
COMMENTS
| Smallest number of factors of all factorizations of n into squarefree numbers, see also A128651, A001055. - Reinhard Zumkeller, Mar 30 2007
|
|
|
LINKS
| Daniel Forgues, Table of n, a(n) for n=1..100000
Eric Weisstein's World of Mathematics, Niven's Constant
|
|
|
FORMULA
| a(n) = max(k=1..A001221(n), A124010(n,k) ). [Reinhard Zumkeller, Aug 27 2011]
|
|
|
EXAMPLE
| For n = 72 = 2^3*3^2, a(72) = Max(exponents) = Max(3,2) = 3.
|
|
|
MATHEMATICA
| Table[If[n == 1, 0, Max @@ Last /@ FactorInteger[n]], {n, 100}] (*Chandler*)
|
|
|
CROSSREFS
| Cf. A005361, A008479, A051904, A052409, A091050.
Cf. A129132, A002322.
Sequence in context: A088388 A070013 A070014 * A157754 A072411 A091050
Adjacent sequences: A051900 A051901 A051902 * A051904 A051905 A051906
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| Labos E. (labos(AT)ana.sote.hu), Dec 16 1999
|
| |
|
|
