  We establish an analog of the Hardy-Ramanujan inequality for counting members
of sifted sets with a given number of distinct prime factors. In particular, we
establish a bound for the number of shifted primes p+a below x with k distinct
prime factors, uniformly for all positive integers k.
