For positive integers c≥0 and k≥1, let n=R(c,k) be the least integer, provided it exists, such that every 2-coloring of the set [1,n]={1,…,n} admits a monochromatic solution to the equation x+y+c=4z with x,y,z∈[1,n]. In this paper, the precise value of R(c,4) is shown to be ⌈3c+2/8⌉ for all even c≥34.