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.

A354208 Number of parity-alternating permutations of [n] avoiding the pattern 321.

Original entry on oeis.org

1, 1, 1, 1, 2, 3, 6, 11, 22, 44, 89, 185, 382, 808, 1702, 3635, 7779, 16736, 36229, 78466, 171238, 373203, 819186, 1795611, 3958662, 8721086, 19294525, 42691298, 94733886, 210379132, 468084856, 1042703207, 2325575076, 5193931583, 11609749877, 25986720374, 58203955771
Offset: 0

Views

Author

Per W. Alexandersson, Jun 06 2022

Keywords

Comments

A permutation is parity-alternating if it sends odd integers to odd integers, and even integers to even integers. It avoids 321 if there is no subsequence a..b..c with a > b > c. The values are computed by Michael Albert, see MathOverflow link.

Examples

			For n=4, the two permutations are 1234, 3412.
For n=5, we have 12345, 34125, 14523.
For n=6, we have 123456, 341256, 145236, 125634, 561234, 345612.
		

Crossrefs

Cf. A000108 (321-avoiding permutations), A010551 (parity-alternating permutations).

Extensions

Offset corrected and terms a(30) and beyond from Peter J. Taylor, Jun 10 2022