The more general question would be For any set of primes S, is there a number that is a pseudoprime to all elements of S but is not a Carmichael number? I would guess yes. If so, then it is possible to define a sequence "Smallest non-Carmichael number pseudoprime w.r.t. all primes <= p(n)"