“…When A = (a 1 , a 2 , −a 2 ) for a 1 , a 2 ∈ N the value of R A (2) is computed in [26,Theorem 9.17]; when A = (a 1 , a 2 , −(a 1 + a 2 )) for a 1 , a 2 ∈ N the value of R A (2) is computed in [23, Theorem 1.1]; when A = (1, 1, a 3 , −a 4 ) for a 3 , a 4 ∈ N (where partition regularity of A ensures that a 4 ∈ {1, 2, a 3 , a 3 + 1, a 3 + 2}) the value of R A (2) is computed in [33,Theorems 3,4 and 8] for a 4 = a 3 , a 4 = a 3 + 1 and a 4 = 2 respectively, with the case a 4 = a 3 + 2 being trivial; and when…”