Extremal Graph Theory and Ramsey Theory · Challenge problem

What is the smallest $n$ such that every red/blue coloring of $\{1,2,\dots,n\}$ contains a monochromatic $3$-term arithmetic progression?