... r2+ 1 ∈ A and l 1 ∈ A, [l 1 , n]\{n − ξ2} , if r2+ 1 ∈ A and l 1 ∈ A, (l 1 , n] \{l 1 + ξ3}, if r2+ 1 ∈ A and l 1 ∈ A, [l 1 , n]\{l 1 + ξ4, n − ξ5} , if r2+ 1 ∈ A and l 1 ∈ A, (17 )for ... in a somewhat different way than in [1] , as we will instead use an approach similarto that in the proof of Lemma 2 .1. The final step is to compare A with A 1 to show that A contains almost all of ... (19 99), 14 9 -16 1.[4] K. Dilcher and L.G. Lucht, Finite pattern-free sets of integers, Acta Arith. 12 1,No.4, (2006), 313 -325.[5] J. Knape and U. Larsson, Sets of integers and permutations avoiding...