|
%I #20 Oct 27 2023 21:37:38
%S 1,1,2,6,23,110,632,4237,32465,279828,2679950,28232972,324470844,
%T 4039771856,54165468774,778128659247,11923645252411,194131328012012,
%U 3346615262190736,60897160676005110,1166446154857250412,23459656378909613446,494290181112325561351
%N Number of permutations that avoid the consecutive pattern 2413.
%H Alois P. Heinz, <a href="/A201693/b201693.txt">Table of n, a(n) for n = 0..140</a> (first 61 terms from Ray Chandler)
%H A. Baxter, B. Nakamura, and D. Zeilberger. <a href="http://www.math.rutgers.edu/~zeilberg/mamarim/mamarimhtml/auto.html">Automatic generation of theorems and proofs on enumerating consecutive Wilf-classes</a>
%H V. Dotsenko and A. Khoroshkin, <a href="http://arxiv.org/abs/1109.2690">Shuffle algebras, homology, and consecutive pattern avoidance</a>, arXiv preprint arXiv:1109.2690, 2011
%F The reference gives a g.f. There is an associated triangle of numbers c_{n,l} that should be added to the OEIS if it is not already present.
%Y Cf. A113228, A113229, A117156, A117158, A117226, A201692.
%K nonn,easy
%O 0,3
%A _N. J. A. Sloane_, Dec 03 2011
%E More terms from _Ray Chandler_, Dec 06 2011
|
