Smallest weak Carmichael numbers with a fixed number of prime factors

For a composite integer, call the number of distinct prime divisors its number of prime factors. Smallest weak Carmichael number conjecture. For every integer $k\ge 3$, the smallest weak Carmichael number with $k$ distinct prime factors is a Carmichael number. This is stated as a computationally motivated conjecture.