|
%I #20 Mar 03 2023 07:51:59
%S 255255,285285,345345,373065,435435,440895,451605,465465,504735,
%T 533715,555555,569415,596505,608685,615615,636405,645645,672945,
%U 680295,692835,705705,719355,726495,752115,770385,780045,795795,803985,805035,811965,823515,838695,844305,858585
%N Products of 6 distinct odd primes.
%H David A. Corneth, <a href="/A168352/b168352.txt">Table of n, a(n) for n = 1..10000</a>
%F A067885 INTERSECT A005408. [_R. J. Mathar_, Nov 24 2009]
%e 255255 = 3*5*7*11*13*17
%e 285285 = 3*5*7*11*13*19
%e 345345 = 3*5*7*11*13*23
%e 435435 = 3*5*7*11*13*29
%t f[n_]:=Last/@FactorInteger[n]=={1,1,1,1,1,1}&&FactorInteger[n][[1,1]]>2; lst={};Do[If[f[n],AppendTo[lst,n]],{n,6*9!}];lst
%o (PARI) is(n) = {n%2 == 1 && factor(n)[,2]~ == [1,1,1,1,1,1]} \\ _David A. Corneth_, Aug 26 2020
%o (Python)
%o from sympy import primefactors, factorint
%o print([n for n in range(1, 1000000, 2) if len(primefactors(n)) == 6 and max(list(factorint(n).values())) == 1]) # _Karl-Heinz Hofmann_, Mar 01 2023
%Y Cf. A005408, A067885.
%Y Cf. A046391 (5 distinct odd primes).
%K nonn,easy
%O 1,1
%A _Vladimir Joseph Stephan Orlovsky_, Nov 23 2009
%E Definition corrected by _R. J. Mathar_, Nov 24 2009
%E More terms from _David A. Corneth_, Aug 26 2020
|
