For [itex]\lambda= 1[/itex] you have, as I said before, [itex]-x_2= x_2[/itex],[itex]-x_3= x_3[/itex], etc. That tells you that [itex]x_2= x_3= \cdot\cdot\cdot= 0[/itex]! Then, of course, the first equation, [itex]x_2+ x_1+ \cdot\cdot\cdot+ x_n= 0[/itex] is automatically satisfied. Every number except [itex]x_1[/itex] must be 0. Since [itex]x_1[/itex] does not appear in any equation, it is arbitrary. All eigenvectors corresponding to [itex]\lambda= 1[/itex] are of the form <a, 0, 0, ..., 0> which is spanned, of course, by <1, 0, 0, ..., 0>.
If [itex]\lambda= 0[/itex] then you have the single equation [itex]x_1+ x_2+ \cdot\cdot\cdot+ \x_n= 0[/itex] which is the same as [itex]x_n= -(x_1+ x_2+ x_3+ \cdot\cdot\cdot+ x_{n-1})[/itex].
Now do as I have suggested before: take each [itex]x_i[/itex] equal to 0 in turn, the others 0, and solve for [itex]x_n[/itex]. That will give you the n-1 vectors you need.