login
A206736
Number of permutations of length n which avoid the patterns 1234, 4321.
0
1, 2, 6, 22, 86, 306, 882, 1764, 1764, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
OFFSET
1,2
REFERENCES
Kremer, Darla; and Shiu, Wai Chee; Finite transition matrices for permutations avoiding pairs of length four patterns. Discrete Math. 268 (2003), no. 1-3, 171-183. MR1983276 (2004b:05006). See Table 1.
FORMULA
0 for n >= 10.
CROSSREFS
Begins in the same way as A079105.
Sequence in context: A150253 A150254 A148497 * A079105 A079104 A116705
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Feb 11 2012
STATUS
approved