We will show applications of a lemma of Aline Bostan to prove that some pattern avoiding permutation classes have non-algebraic generating functions. We will also show analogous results for sequences counting permutations that contain a given pattern just once. These type of results are hard to find because there are not many tools to prove them. Bostan's lemma extends our toolbox.