Let E n = {[τ ]a = (τ (a1) 1 , . . . , τ (an) n )|τ ∈ Sn, 1 ≤ ai ≤ r} be the set of all signed permutations on the symbols 1, 2, . . . , n with signs 1, 2, . . . , r. We prove, for every 2-letter signed pattern [τ ]a, that the number of [τ ]a-avoiding signed permutations in E n is given by the formula n ∑ j=0 j!(r−1) ( n j 2 . Also we prove that there are only one Wilf class for r = 1, four Wil...