The Rado number of an equation is a Ramsey-theoretic quantity associated to the equation. Let E be a linear equation. Denote by R r (E) the minimal integer, if it exists, such that any r-coloring of [1, R r (E)] must admit a monochromatic solution to E. In this paper, we give upper and lower bounds for the Rado number of m−2 i=1 x i + kx m−1 = ℓx m , and some exact values are also given. Furthermore, we derive some results for the cases that ℓ = m = 4 and m = 5, ℓ = k + i (1 ≤ i ≤ 5). As a generalization, the r-color Rado numbers for linear equations E 1 , E 2 , ..., E r is defined as the minimal integer, if it exists, such that any r-coloring of [1, R r (E 1 , E 2 , . . . , E r )] must admit a monochromatic solution to some E i , where 1 ≤ i ≤ r. A lower bound for R r (E 1 , E 2 , . . . , E r ) and the exact values of R 2 (x + y = z, ℓx = y) and R 2 (x + y = z, x + a = y) were given by Lovász Local Lemma.