Integers without divisors from a fixed arithmetic progression
  Let a be an integer and q a prime number. In this paper, we find an asymptotic formula for the number of positive integers n < x with the property that no divisor d > 1 of n lies in the arithmetic progression a modulo q. 
William D. Banks, John B. Friedlander and Florian Luca