cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A137538 Number of permutations in S_n avoiding 25{bar 1}34 (i.e., every occurrence of 2534 is contained in an occurrence of a 25134).

Original entry on oeis.org

1, 1, 2, 6, 23, 104, 532, 3004, 18426, 121393, 851810, 6325151, 49448313, 405298482, 3470885747, 30965656442, 287083987270, 2759838731485, 27458514900626, 282264050120512, 2993392570828096, 32704759586810036, 367673428857985261
Offset: 0

Views

Author

Lara Pudwell, Apr 25 2008

Keywords

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)
The number of permutations of length n avoiding the dashed pattern 1-42-3. - Andrew Baxter, May 17 2011
Apparently, also the number of permutations of length n avoiding the barred pattern 23{bar 1}54, which are the same as the permutations avoiding dashed pattern 1-24-3. - Andrew Baxter, May 17 2011

Examples

			See example in A137546.
		

Crossrefs

Extensions

Edited by Andrew Baxter, May 17 2011
Offset corrected by Alois P. Heinz, Jul 10 2023

A367494 Number of (2+2)-free naturally labeled posets on [n].

Original entry on oeis.org

1, 1, 2, 7, 37, 272, 2637, 32469, 493602, 9062503, 197409097, 5027822588, 147896295785, 4972353491993, 189357434418082, 8104194176872583, 387121098095180237, 20513320778472547576, 1199236185075846230469, 76970026071431034905229, 5399593095642890354948802
Offset: 0

Views

Author

David Bevan, Nov 20 2023

Keywords

Comments

A partial order R is naturally labeled if xRy => x
A partial order is (2+2)-free if it does not contain an induced subposet that is isomorphic to the union of two disjoint 2-element chains.

Examples

			a(3) = A006455(3) = 7: {}, {1R2}, {1R3}, {2R3}, {1R2, 1R3}, {1R3, 2R3}, {1R2, 1R3, 2R3}.
a(4) = A006455(4) - 3 = 37: {1R2, 3R4}, {1R3, 2R4} and {1R4, 2R3} (trivially) contain a 2+2 subposet.
		

Crossrefs

Cf. A006455 (naturally labeled posets), A113226 ({3,2+2}-free naturally labeled posets).
Showing 1-2 of 2 results.