The van der Waerden number W(k,r) denotes the smallest n such that whenever the set {1,...,n} is colored with r colors there exists a monochromatic k-term arithmetic progression. In this talk we will present some new lower bounds in the multicolored case (meaning that r is at least 3).