We consider triples τ of 3-letter patterns for which ascent sequences that avoid τ are counted by Fibonacci-related numbers. Several cases are equivalent to avoiding a pair of 3-letter patterns and have already been treated using generating functions. Here we give direct proofs of all our results. We also consider avoiders for some quadruples of 3-letter patterns.
No takes yet. Share an insight, caveat, or question.
Callan et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: