This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A057715 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. 3
 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; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Lei Zhou, Table of n, a(n) for n = 1..10000 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 &] (* Ray Chandler, Nov 06 2008 *) CROSSREFS Sequence in context: A126855 A102749 A085231 * A053990 A026365 A051435 Adjacent sequences:  A057712 A057713 A057714 * A057716 A057717 A057718 KEYWORD nonn,easy AUTHOR Leroy Quet, Oct 24 2000 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 16 23:49 EDT 2019. Contains 325092 sequences. (Running on oeis4.)