Carmichael numbers in the sequence $(2^n k+1)_{n\geq 1}$

Abstract

We prove that for each odd number k, the sequence {k2 n +1}n�1 contains only a finite number of Carmichael numbers. We also prove that k = 27 is the smallest value for which such a sequence contains some Carmichael number.