Let [tex]f(x,y)=y'[/tex]. In Euler's method, we start with an initial value [tex]y_0=y(x_0)[/tex] and recursively compute
[tex]\begin{cases}x_{n+1}=x_n+h\\y_{n+1}=y_n+f(x_n,y_n)h\end{cases}[/tex]
for [tex]n\ge0[/tex] and where [tex]h=0.5[/tex].
For example, when [tex]n=0[/tex], we have
[tex]y_1=y_0+0.5(2-5x_0+2y_0)\implies y_1=0+0.5(2-5+0)\implies y_1=-1.5[/tex]
and so on. A table can help organize this:
[tex]\begin{array}{ccccc}n&x_n&y_n&f(x_n,y_n)&y_{n+1}\\0&1&0&-3&\boxed{-1.5}\\1&1.5&-1.5&-8.5&\boxed{-5.75}\\2&2&-5.75&-19.5&\boxed{-15.5}\\3&2.5&-15.5&-41.5&\boxed{-36.25}\end{array}[/tex]