Enumerating permutations that avoid three term arithmetic progressions (Q1028844)

Summary: It is proved that the number of permutations of the set \(\{1, 2, 3, \dots, n\}\) that avoid three term arithmetic progressions is at most \(\frac{(2.7)^n}{21}\) for \(n \geq 11\) and at each end of any such permutation, at least \(\lfloor \frac{n}{2} \rfloor - 6\) entries have the same parity.