id:A057715 - OEIS Search Results

Search: id:A057715

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
2

12, 24, 40, 45, 48, 56, 63, 80, 96, 112, 135, 144, 160, 175, 176, 189, 192, 208, 224, 275, 288, 297, 320, 325, 351, 352, 384, 405, 416, 425, 448, 459, 475, 513, 539, 544, 567, 575, 576, 608, 621, 637, 640, 675, 704, 720, 736, 768, 800, 832, 833, 864, 875 (list; graph; listen)

	OFFSET	`0,1`
	LINKS	`Leroy Quet, Home Page (listed in lieu of email address)`
	EXAMPLE	`720 is included because 720 = 2^4 3^2 5^1 and 2^4 > 3^2 > 5^1.`
	MATHEMATICA	`Select[Range[575], Greater @@ Power @@@ (fi = FactorInteger[ # ]) && Length[fi] > 1 &] [From Ray Chandler (rayjchandler(AT)sbcglobal.net), Nov 06 2008]`
	CROSSREFS	`Sequence in context: A126855 A102749 A085231 this_sequence A053990 A026365 A051435` `Adjacent sequences: A057712 A057713 A057714 this_sequence A057716 A057717 A057718`
	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