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”).

A116747
Number of permutations of length n which avoid the patterns 1234, 2413, 3241.
0
1, 2, 6, 21, 72, 230, 689, 1970, 5460, 14833, 39790, 105890, 280367, 739878, 1948186, 5121973, 13451620, 35299782, 92580429, 242705586, 636062896, 1666534337, 4365640346, 11434584546, 29946505947, 78421715110, 205352199014
OFFSET
1,2
FORMULA
G.f.: A(x) = -{x(2x^6-12x^5+24x^4-31x^3+21x^2-7x+1)}/{(2x-1)(x^2-3x+1)(x-1)^4}
a(0)=1, a(1)=2, a(2)=6, a(3)=21, a(4)=72, a(5)=230, a(6)=689, a(n)= 9*a(n-1)-33*a(n-2)+64*a(n-3)-71*a(n-4)+45*a(n-5)-15*a(n-6)+2*a(n-7) [From Harvey P. Dale, May 19 2011]
MATHEMATICA
LinearRecurrence[{9, -33, 64, -71, 45, -15, 2}, {1, 2, 6, 21, 72, 230, 689}, 40] (* or *) Rest[CoefficientList[Series[-(x(2x^6-12x^5+24x^4-31x^3+21x^2-7x+1))/ ((2x-1)(x^2-3x+1)(x-1)^4), {x, 0, 40}], x]] (* Harvey P. Dale, May 19 2011 *)
CROSSREFS
Sequence in context: A116748 A116812 A116830 * A116810 A294703 A116800
KEYWORD
nonn,easy
AUTHOR
Lara Pudwell, Feb 26 2006
STATUS
approved