OFFSET
3,2
COMMENTS
a(n,k) counts the permutations in S_n which have zero occurrences of the pattern 213 and one occurrence of the pattern 123 and k descents.
REFERENCES
D. Hök, Parvisa mönster i permutationer [Swedish], (2007).
LINKS
Alois P. Heinz, Rows n = 3..201, flattened
FORMULA
a(n,k) = s(n,k)+t(n,k), s(n,k) = a(n-1,k-1), t(n,k) = C(n-2,2*n-5-2*k) + t(n-1,k-1) + s(n-1,k), a(3,0)=t(3,0)=1.
EXAMPLE
Triangle begins:
n\k 0 1 2 3 4 5 6
----------------------------------
3 1;
4 . 4;
5 . . 10;
6 . . 12, 20;
7 . . 3, 42, 35;
8 . . . 24, 112, 56;
9 . . . 4, 108, 252, 84;
CROSSREFS
KEYWORD
nonn,tabf
AUTHOR
David Hoek (david.hok(AT)telia.com), Mar 28 2007
EXTENSIONS
Edited by Peter Bala, Dec 05 2013
STATUS
approved