id:A051903 - OEIS Search Results

Search: id:A051903

Displaying 1-1 of 1 results found.

page 1

A051903

Maximal exponent in prime factorization of n.

+0
40

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; listen)

	OFFSET	`1,4`
	COMMENT	`Smallest number of factors of all factorizations of n into square-free numbers, see also A128651, A001055. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Mar 30 2007`
	LINKS	`T. D. Noe, Table of n, a(n) for n=1..10000` `Eric Weisstein's World of Mathematics, Niven's Constant`
	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 this_sequence A072411 A091050 A005361` `Adjacent sequences: A051900 A051901 A051902 this_sequence A051904 A051905 A051906`
	KEYWORD	`nonn,easy`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Dec 16 1999`

page 1

Search completed in 0.003 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research