−There is a solution to this beautiful problem using summation symbols ∑ .
I am unable to present it here because of the luck of the lower and upper limits
in the summation symbols of the existing editor.
Using the aforementioned method we ended up a0 = a1= -1
and the recursive formula an+1=( 2 an-1+an ) / (n + 1) for all n≥ 1
For n=1 the recursive formula yields a2= -3/2
For n =2 we get a3= -7/6 and so on.
Another approach , would be to notice that the given differential equation is a separable one
with solution y(t) = −et^2 ·et . Then expand et^2 and et as power series , then multiply them and
collect the four first terms.

Adam B.
06/23/21