A137537 Number of permutations in S_n avoiding 5134{bar 2} (i.e., every occurrence of 5134 is contained in an occurrence of a 51342).

1, 1, 2, 6, 23, 104, 532, 3003, 18400, 120960, 845823, 6249642, 48539947, 394620211, 3346466726, 29516055880

Offset

0,3

Comments

From Lara Pudwell, Oct 23 2008: (Start)

A permutation p avoids a pattern q if it has no subsequence that is order-isomorphic to q. For example, p avoids the pattern 132 if it has no subsequence abc with a < c < b.

Barred pattern avoidance considers permutations that avoid a pattern except in a special case. Given a barred pattern q, we may form two patterns, q1 = the sequence of unbarred letters of q and q2 = the sequence of all letters of q.

A permutation p avoids barred pattern q if every instance of q1 in p is embedded in a copy of q2 in p. In other words, p avoids q1, except in the special case that a copy of q1 is a subsequence of a copy of q2.

For example, if q = 5{bar 1}32{bar 4}, then q1 = 532 and q2 = 51324. p avoids q if every for decreasing subsequence acd of length 3 in p, one can find letters b and e so that the subsequence abcde of p has b < d < c < e < a. (End)

Links

Table of n, a(n) for n=0..15.

Lara Pudwell, Enumeration Schemes for Pattern-Avoiding Words and Permutations, Ph. D. Dissertation, Math. Dept., Rutgers University, May 2008.

Lara Pudwell, Enumeration schemes for permutations avoiding barred patterns, El. J. Combinat. 17 (1) (2010) R29.

Example

See example in A137546.

Crossrefs

Cf. A137546.

Sequence in context: A030266 A110447 A137536 * A137538 A137539 A137540

Adjacent sequences: A137534 A137535 A137536 * A137538 A137539 A137540

Keyword

nonn,more

Author

Lara Pudwell, Apr 25 2008

Extensions

a(8)-(15) from Lars Blomberg, Jun 04 2018

a(0)=1 prepended by Alois P. Heinz, Jul 10 2023

Status

approved