|
%I #30 Dec 10 2020 01:31:44
%S 1,1,2,6,21,80,322,1346,5783,25372,113174,511649,2338988,10793251,
%T 50205607,235156609,1108120540,5249646137,24987770893,119443412277,
%U 573125649031,2759515312908,13328311926552,64559295743113,313530998739472,1526333617345412,7447070497787110,36409703715788374,178353171835771153,875224495042876048,4302111437028045585
%N Number of permutations of length n that avoid the patterns 4231, 4312, and 4321.
%C a(n) is the number of permutations of length n avoiding the partially ordered pattern (POP) {1>2, 1>3, 2>4} of length 4. That is, the number of length n permutations having no subsequences of length 4 in which the first element is the largest and the second element is larger than the fourth element. - _Sergey Kitaev_, Dec 09 2020
%H Jay Pantone, <a href="/A257561/b257561.txt">Table of n, a(n) for n = 0..500</a>
%H Michael H. Albert, Cheyne Homberger, Jay Pantone, Nathaniel Shar, Vincent Vatter, <a href="http://arxiv.org/abs/1510.00269">Generating Permutations with Restricted Containers</a>, arXiv:1510.00269 [math.CO], 2015.
%H D. Callan, T. Mansour, <a href="http://arxiv.org/abs/1705.00933">Enumeration of small Wilf classes avoiding 1324 and two other 4-letter patterns</a>, arXiv:1705.00933 [math.CO] (2017), Table 1 No. 241.
%H Alice L. L. Gao, Sergey Kitaev, <a href="https://arxiv.org/abs/1903.08946">On partially ordered patterns of length 4 and 5 in permutations</a>, arXiv:1903.08946 [math.CO], 2019.
%H Alice L. L. Gao, Sergey Kitaev, <a href="https://doi.org/10.37236/8605">On partially ordered patterns of length 4 and 5 in permutations</a>, The Electronic Journal of Combinatorics 26(3) (2019), P3.26.
%F G.f. satisfies (2*x^2+8*x-1)*F(x)^4 + (x^3+4*x^2-46*x+5)*F(x)^3 + (3*x^3-21*x^2+94*x-9)*F(x)^2 + (x^3+12*x^2-82*x+7)*F(x) + 3*x^2+26*x-2 = 0. - _Jay Pantone_, Oct 01 2015
%e a(4) = 21 because there are 24 permutations of length 4, and 3 of them do not avoid 4231, 4312, and 4321.
%K nonn
%O 0,3
%A _Jay Pantone_, Apr 30 2015
|
