Partial coverings and conditions for Sierpiński candidates

Wacław Sierpiński proved that there exist infinitely many odd integers $k$ such that numbers of the form $k\cdot 2^n + 1$ are never prime for any integer $n$. The values of $k$ with this property are called Sierpiński numbers. The Sierpiński Problem is to find the smallest Sierpiński number.