login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A294703
Number of permutations of [n] avoiding {1324, 2341, 4123}.
0
1, 1, 2, 6, 21, 72, 230, 701, 2113, 6475, 20468, 66969, 226027, 782276, 2760094, 9880455, 35758457, 130507165, 479487736, 1771213935, 6572533275, 24484124014, 91520352034, 343139355270, 1290071981495, 4862298799421, 18368091363064, 69535094533135, 263751173112167
OFFSET
0,3
LINKS
D. Callan, T. Mansour, Enumeration of small Wilf classes avoiding 1324 and two other 4-letter patterns, arXiv:1705.00933 [math.CO] (2017), Table 1 No 49.
FORMULA
a(n) = A000108(n) -3*n^3/8 +3*n^2/2 -17*n/15 +3 +n^5/120 +2^(n-1)*(n-4), n>0. - R. J. Mathar, Mar 21 2021
MAPLE
C := (1-sqrt(1-4*x))/2/x ;
p := x^3-3*x^4+3*x^5-5*x^6+9*x^7-4*x^8 ;
q := (1-x)^6*(1-2*x)^2 ;
taylor(C+p/q, x=0, 40) ;
gfun[seriestolist](%) ;
CROSSREFS
Sequence in context: A116830 A116747 A116810 * A116800 A116758 A116838
KEYWORD
nonn,easy
AUTHOR
R. J. Mathar, Nov 07 2017
STATUS
approved