Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A117107
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A117107 Number of permutations in S_n avoiding 21{bar 3}54 (i.e. every occurrence of 2154 is contained in an occurrence of a 21354) and such that the graph corresponding to the permutation is connected (see "Forest-like permutations" below). +0
1
1, 1, 3, 12, 57, 304, 1765, 10943, 71519, 488186, 3456526, 25251479, 189545179 (list; graph; listen)
OFFSET

1,3

COMMENT

Comment from Lara Pudwell (Lara.Pudwell(AT)valpo.edu), 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

M. Bousquet-Melou and S. Butler, Forest-like permutations

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

EXAMPLE

See example in A137546.

CROSSREFS

Sequence in context: A151498 A103370 A094149 this_sequence A159609 A128326 A014333

Adjacent sequences: A117104 A117105 A117106 this_sequence A117108 A117109 A117110

KEYWORD

nonn

AUTHOR

Steve Butler (sbutler(AT)math.ucsd.edu), Apr 18 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research