We present in this report the methods that provide better upper bounds for the number ) of permutations of length n avoiding the pattern q. rnWe consider permutations that avoid the pattern q of length three, four and monotone patterns only. We use Milk Bna result to show that