id:A051904 - OEIS Search Results

Search: id:A051904

Displaying 1-1 of 1 results found.

page 1

A051904

Minimal exponent in prime factorization of n.

+0
23

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

	OFFSET	`1,4`
	LINKS	`Eric Weisstein's World of Mathematics, Niven's Constant` `Eric Weisstein's World of Mathematics, Niven's Constant`
	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: A037861 A072410 A052409 this_sequence A070012 A071178 A072776` `Adjacent sequences: A051901 A051902 A051903 this_sequence A051905 A051906 A051907`
	KEYWORD	`nonn,easy`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Dec 16 1999`

page 1

Search completed in 0.002 seconds

Last modified September 5 01:44 EDT 2008. Contains 143476 sequences.

AT&T Labs Research