|
|
A168352
|
|
Products of 6 distinct odd primes.
|
|
3
|
|
|
255255, 285285, 345345, 373065, 435435, 440895, 451605, 465465, 504735, 533715, 555555, 569415, 596505, 608685, 615615, 636405, 645645, 672945, 680295, 692835, 705705, 719355, 726495, 752115, 770385, 780045, 795795, 803985, 805035, 811965, 823515, 838695, 844305, 858585
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
255255 = 3*5*7*11*13*17
285285 = 3*5*7*11*13*19
345345 = 3*5*7*11*13*23
435435 = 3*5*7*11*13*29
|
|
MATHEMATICA
|
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
|
|
PROG
|
(PARI) is(n) = {n%2 == 1 && factor(n)[, 2]~ == [1, 1, 1, 1, 1, 1]} \\ David A. Corneth, Aug 26 2020
(Python)
from sympy import primefactors, factorint
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
|
|
CROSSREFS
|
Cf. A046391 (5 distinct odd primes).
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|