id:A057714 - OEIS Search Results

Search: id:A057714

Displaying 1-1 of 1 results found.

page 1

If (p_k)^(c_k) is highest power of p_k dividing n (where p_k is a prime dividing n and p_k > p_j for all k > j), then (p_k)^(c_k) > (p_j)^(c_j) for all k > j.

+0
3

6, 10, 14, 15, 18, 20, 21, 22, 26, 28, 30, 33, 34, 35, 36, 38, 39, 42, 44, 46, 50, 51, 52, 54, 55, 57, 58, 62, 65, 66, 68, 69, 70, 72, 74, 75, 76, 77, 78, 82, 85, 86, 87, 88, 91, 92, 93, 94, 95, 98, 99, 100, 102, 104, 105, 106, 108, 110, 111, 114, 115, 116, 117, 118 (list; graph; listen)

	OFFSET	`0,1`
	LINKS	`Leroy Quet, Home Page (listed in lieu of email address)`
	EXAMPLE	`140 is included because 140 = 2^2 5^1 7^1 and 2^2 < 5^1 < 7^1.`
	MATHEMATICA	`Select[Range[120], Less @@ Power @@@ (fi = FactorInteger[ # ]) && Length[fi] > 1 &] [From Ray Chandler (rayjchandler(AT)sbcglobal.net), Nov 06 2008]`
	CROSSREFS	`Sequence in context: A138592 A085232 A085234 this_sequence A143907 A132982 A069169` `Adjacent sequences: A057711 A057712 A057713 this_sequence A057715 A057716 A057717`
	KEYWORD	`nonn`
	AUTHOR	`Leroy Quet Oct 24 2000`

page 1

Search completed in 0.002 seconds

Last modified November 30 13:13 EST 2009. Contains 167758 sequences.

AT&T Labs Research