The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A258374 Least primitive weird number with n prime divisors, not counting multiplicity. 8

%I

%S 70,4030,4199030,1550860550

%N Least primitive weird number with n prime divisors, not counting multiplicity.

%C A proper subset of A002975.

%C So far all terms are == 2 (mod 4).

%C From _M. F. Hasler_, Jul 18 2016: (Start)

%C a(3) = 2 * 5 * 7 = A002975(1) = A258882(1),

%C a(4) = 2 * 5 * 13 * 31 = A258401(1) = A258883(1),

%C a(5) = 2 * 5 * 11 * 59 * 647 = A258884(1),

%C a(6) = 2 * 5^2 * 29 * 37 * 137 * 211 = A258885(1) = A273815(1). (End)

%C 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

%C a(7) <= 2 * 5 * 11 * 89 * 167 * 829 * 7972687 ≈ 1.1e16. - _M. F. Hasler_, Feb 18 2018

%t (* copy the terms from A002975, assign them equal to 'lst' and then *) Table[ Min@ Select[ lst, PrimeNu@# == n &], {n, 3, 6}]

%Y Cf. A002975, A258375.

%K nonn,hard,more

%O 3,1

%A _Robert G. Wilson v_, May 28 2015

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 June 23 11:02 EDT 2021. Contains 345397 sequences. (Running on oeis4.)