A permutation pattern that illustrates the strong law of small numbers

2011/11/27 by Callan, David
#05A15 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1111.6297

Abstract

We obtain an explicit formula for the number of permutations of [n] that avoid the barred pattern bar143bar52. A curious feature of its counting sequence, 1, 1, 2, 5, 14, 43, 145, 538, 2194,..., is that the displayed terms agree with A122993 in the On-Line Encyclopedia of Integer Sequences, but the two sequences diverge thereafter.

Related

• The number of 24135-avoiding permutations
• A bijection for length-5 patterns in permutations
• The number of bar3bar1542-avoiding permutations
• The Number of Permutations With A Prescribed Number of 132 and 123 Patterns
• Counting Permutations that Avoid Many Patterns