OFFSET
0,3
COMMENTS
These permutations have an enumeration scheme of depth 4.
G.f. is conjectured to be non-D-finite (see Albert et al link). - Jay Pantone, Oct 01 2015
LINKS
Jay Pantone, Table of n, a(n) for n = 0..1000
Michael H. Albert, Cheyne Homberger, Jay Pantone, Nathaniel Shar, Vincent Vatter, Generating Permutations with Restricted Containers, arXiv:1510.00269 [math.CO], 2015.
Darla Kremer and Wai Chee Shiu, Finite transition matrices for permutations avoiding pairs of length four patterns, Discrete Math. 268 (2003), 171-183. MR1983276 (2004b:05006). See Table 1.
V. Vatter, Enumeration schemes for restricted permutations, Combin., Prob. and Comput. 17 (2008), 137-159.
EXAMPLE
There are 22 permutations of length 4 which avoid these two patterns, so a(4)=22.
CROSSREFS
KEYWORD
nonn
AUTHOR
Vincent Vatter, Sep 21 2009
EXTENSIONS
a(0)=1 prepended by Jay Pantone, Oct 01 2015
STATUS
approved