This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A057714 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

%I

%S 6,10,14,15,18,20,21,22,26,28,30,33,34,35,36,38,39,42,44,46,50,51,52,

%T 54,55,57,58,62,65,66,68,69,70,72,74,75,76,77,78,82,85,86,87,88,91,92,

%U 93,94,95,98,99,100,102,104,105,106,108,110,111,114,115,116,117,118

%N 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.

%H Lei Zhou, <a href="/A057714/b057714.txt">Table of n, a(n) for n = 1..10000</a>

%e 140 is included because 140 = 2^2 * 5^1 * 7^1 and 2^2 < 5^1 < 7^1.

%t Select[Range[120], Less @@ Power @@@ (fi = FactorInteger[#]) && Length[fi] > 1 &] (* _Ray Chandler_, Nov 06 2008 *)

%K nonn

%O 1,1

%A _Leroy Quet_, Oct 24 2000

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 19 12:32 EDT 2019. Contains 325159 sequences. (Running on oeis4.)