1,2

The oscillations are bounded affine permutations. For the definition of a bounded affine permutation, see Definitions 1 and 2 in Madras and Troyka.

The infinite (increasing) oscillation O is described by the function f defined as f(s) = s - 4*(-1)^s - 2 with s in the set of integers, while the finite (increasing) oscillations are indecomposable permutations, i.e., that are not the sum of two permutations of nonzero size, and that are contained in O.

For each m >= 3, there are exactly two oscillations of size m: 312 and 231, 3142 and 2413, and so on (see p. 22 of Madras and Troyka).

Michael H. Albert, Robert Brignall, Vincent Vatter, Large infinite antichains of permutations, arXiv:1212.3346 [math.CO], 2012; Pure Mathematics and Applications, 24(2) pp. 47-57 (2013).

Neal Madras, Justin M. Troyka, Bounded affine permutations I. Pattern avoidance and enumeration, arXiv:2003.00267 [math.CO], 2020.

Vincent Vatter, Small permutation classes, arXiv:0712.4006 [math.CO], 2007; Proc. Lond. Math. Soc. 103 (2011), 879-921.

T(n, 1) = A158478(n).

1

2 1

3 1 2

2 3 1

3 1 4 2

2 4 1 3

3 1 5 2 4

2 4 1 5 3

3 1 5 2 6 4

2 4 1 6 3 5

Cf. A000142, A266977, A158478, A333616 (row sums).

Sequence in context: A389146 A294901 A347042 * A305818 A303757 A182850

Adjacent sequences: A333413 A333414 A333415 * A333417 A333418 A333419

nonn,tabf,more

Stefano Spezia, Mar 24 2020

approved