|
|
A258374
|
|
Least primitive weird number with n prime divisors, not counting multiplicity.
|
|
8
|
|
|
|
OFFSET
|
3,1
|
|
COMMENTS
|
So far all terms are == 2 (mod 4).
a(5) = 2 * 5 * 11 * 59 * 647 = A258884(1),
a(7) <= 4 * 13 * 17 * 449 * 24809 * 228259243 * 11449243661 ≈ 2.6e28, a(8) <= 4 * 13 * 17 * 449 * 24809 * 223842061 * 1123622795959 * 16039588627050434791 ≈ 3.97 e49. - M. F. Hasler, Aug 02 2016
a(7) <= 2 * 5 * 11 * 89 * 167 * 829 * 7972687 ≈ 1.1e16. - M. F. Hasler, Feb 18 2018
|
|
LINKS
|
|
|
MATHEMATICA
|
(* copy the terms from A002975, assign them equal to 'lst' and then *) Table[ Min@ Select[ lst, PrimeNu@# == n &], {n, 3, 6}]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|