We present some new classes of numbers that are easier to test for
primality with the Elliptic Curve Primality Proving algorithm than
average numbers. It is shown that this is the case for about half the
numbers of the Cunningham project. Computational examples are given.