cp's OEIS Frontend

A256199 Number of permutations in S_n that avoid the pattern 53124.

%I A256199 #21 Sep 29 2021 02:38:03
%S A256199 1,1,2,6,24,119,694,4580,33252,260202,2161837,18858720,171285237,
%T A256199 1609282391,15561356705,154246419725,1562151687940,16121960812335,
%U A256199 169178376076607,1801800479418116,19446010522240384,212394673429250090,2345064355131025130,26148064110299271293
%N A256199 Number of permutations in S_n that avoid the pattern 53124.
%H A256199 Anthony Guttmann, <a href="/A256199/b256199.txt">Table of n, a(n) for n = 0..25</a>
%H A256199 Nathan Clisby, Andrew R. Conway, Anthony J. Guttmann, Yuma Inoue, <a href="https://arxiv.org/abs/2109.13485">Classical length-5 pattern-avoiding permutations</a>, arXiv:2109.13485 [math.CO], 2021.
%H A256199 Zvezdelina Stankova-Frenkel and Julian West, <a href="http://arxiv.org/abs/math/0103152">A new class of Wilf-equivalent permutations</a>, arXiv:math/0103152 [math.CO], 2001.
%t A256199 avoid[n_, pat_] := Module[{p1 = pat[[1]], p2 = pat[[2]], p3 = pat[[3]], p4 = pat[[4]], p5 = pat[[5]], lseq = {}, i, p,
%t A256199     lpat = Subsets[(n + 1) - Range[n], {Length[pat]}],
%t A256199     psn = Permutations[Range[n]]},
%t A256199    For[i = 1, i <= Length[lpat], i++,
%t A256199     p = lpat[[i]];
%t A256199     AppendTo[lseq, Select[psn, MemberQ[#, {___, p[[p1]], ___, p[[p2]], ___, p[[p3]], ___, p[[p4]], ___, p[[p5]], ___}, {0}] &]];
%t A256199     ]; n! - Length[Union[Flatten[lseq, 1]]]];
%t A256199 Table[avoid[n, {5, 3, 1, 2, 4}], {n, 0, 8}]  (* _Robert Price_, Mar 27 2020 *)
%Y A256199 Representatives for the 16 Wilf-equivalence patterns of length 5 are given in A116485, A047889, and A256195-A256208.
%Y A256199 Cf. A099952.
%K A256199 nonn
%O A256199 0,3
%A A256199 _N. J. A. Sloane_, Mar 19 2015
%E A256199 More terms from _Anthony Guttmann_, Sep 29 2021