Permutations Containing Many Patterns
  It is shown that the maximum number of patterns that can occur in a permutation of length $n$ is asymptotically $2^n$. This significantly improves a previous result of Coleman. 
M.H.Albert, Micah Coleman, Ryan Flynn, Imre Leader