Van der Waerden number $W(3,4)$
The smallest number $n$ such that if the integers $1$ to $n$ are colored with $3$ colors, there must be a monochromatic arithmetic progression of length $4$.
Value: $293$
Updates
-
2012
Lower bound: $293$
Kouril, Michal (2012). Computing the van der Waerden number W(3,4)=293. Integers. 12: A46.
[via Van der Waerden number - Wikipedia] -
2012
Upper bound: $293$
Kouril, Michal (2012). Computing the van der Waerden number W(3,4)=293. Integers. 12: A46.
[via Van der Waerden number - Wikipedia]