The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A230766 Numbers with more than one prime factor and, in the ordered factorization, the exponent never decreases when read from left to right. 2

%I #13 May 22 2020 12:44:35

%S 6,10,14,15,18,21,22,26,30,33,34,35,36,38,39,42,46,50,51,54,55,57,58,

%T 62,65,66,69,70,74,75,77,78,82,85,86,87,91,93,94,95,98,100,102,105,

%U 106,108,110,111,114,115,118,119,122,123,129,130,133,134,138,141

%N Numbers with more than one prime factor and, in the ordered factorization, the exponent never decreases when read from left to right.

%F If n = prod_{k=1..m} p(k)^e(k), then m > 1 and e(1) <= e(2) <= ... <= e(m).

%t fQ[n_] := Module[{f = Transpose[FactorInteger[n]][[2]]}, Length[f] > 1 && Min[Differences[f]] >= 0]; Select[Range[2, 200], fQ] (* _T. D. Noe_, Nov 04 2013 *)

%t Select[Range[150],PrimeNu[#]>1&&Min[Differences[FactorInteger[#][[All,2]]]]>=0&] (* _Harvey P. Dale_, May 22 2020 *)

%o (PARI) isok(n) = {my(f = factor(n), nbf = #f~); if (nbf < 2, return (0)); lastexp = 0; for (i=1, nbf, if ((newexp = f[i, 2]) < lastexp, return (0)); lastexp = newexp;); return (1);} \\ _Michel Marcus_, Oct 30 2013

%Y Cf. A097318, A097319, A097320.

%K nonn

%O 1,1

%A _Alex Ratushnyak_, Oct 29 2013

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 3 00:27 EDT 2024. Contains 373054 sequences. (Running on oeis4.)