OFFSET
0,2
COMMENTS
A signed permutation w corresponds to a matrix with exactly one nonzero entry in each row and column and that entry is either 1 or -1. A signed permutation avoids the pattern (1 2 -3) if no three rows and three columns gives a submatrix with diagonal entries 1 1 -1.
LINKS
Andrew Howroyd, Table of n, a(n) for n = 0..500
S. C. Billey, Pattern Avoidance and Rational Smoothness of Schubert varieties, Advances in Math, vol. 139 (1998) pp. 141-156.
E. Richmond and W. Slofstra, Staircase diagrams and enumeration of smooth Schubert varieties, arXiv:1510.06060 [math.CO], 2015; J. Combin. Ser. A, Vol 150 (2017) pp. 328-376.
FORMULA
G.f: ((1-5*x+5*x^2)*(1-x)+(2*x-x^2)*(1-x)*sqrt(1-4*x))/(1-6*x+8*x^2-4*x^3). - Edward Richmond, Apr 06 2021
EXAMPLE
a(2) = 7 because there are 8 signed permutations of two elements and there is exactly one bad pattern of length 2.
PROG
(PARI) seq(n)=Vec(((1-5*x+5*x^2)*(1-x)+(2*x-x^2)*(1-x)*sqrt(1-4*x + O(x^n)))/(1-6*x+8*x^2-4*x^3)) \\ Andrew Howroyd, Apr 06 2021
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Sara Billey, May 15 2001
EXTENSIONS
a(0)=1 prepended and a(10)-a(25) from Edward Richmond, Apr 05 2021
STATUS
approved