Maximal pattern complexity was introduced by Teturo Kamae and Luca Zamboni in 2002 as a way to link word complexity and sequence entropy. In this same paper, they introduced the idea of a pattern Sturmian over two letters, an aperiodic sequence with the lowest possible maximal pattern complexity on a two letter alphabet. In this talk, we will introduce some established results about sequences with low maximal pattern complexity and some new results extending the understanding of sequences of low maximal pattern complexity on larger alphabets.