Extremal Graph Theory and Ramsey Theory · Superchallenge problem

What is the largest $n$ such that $\{1,2,\dots,n\}$ can be colored with $3$ colors so that no color class contains $x,y,z$ with $x+y=z$ ($x=y$ allowed)?