Given the following recurrence relation for $a_n, b_n, c_n, d_n,e_n,n \in \Bbb{N}$:
\begin{cases} a_{n+1} = a_n + b_n + c_n+d_n, \\ b_{n+1} = -2a_n -\frac{5}{2}b_n-3c_n-3d_n-e_n, \\ c_{n+1} = \frac{5}{2}a_n +3b_n+\frac{7}{2}c_n+3d_n+2e_n \\ d_{n+1} = -\frac{5}{2}a_n -\frac{3}{2}b_n-\frac{3}{2}c_n-d_n-e_n \\ e_{n+1} = (9a_n+5b_n+3c_n+d_n+e_n)/2 \\ \end{cases}
Is there a way to get something like
$a_{n+1} = p a_n + qa_{n-1} + ra_{n-2}+....$
$b_{n+1} = e b_n + fb_{n-1} + gb_{n-2}+....$
...
Thanks in advance!
Edit: accidentally I found:
$a_{n+1}=-a_{n-1}$
This is a sequence given by the linear recursion implemented by the matrix $$ A= \begin{bmatrix} 1 & 1 & 1 & 1 & 0 \\ -2 & -\frac{5}{2} & -3 & -3 & -1 \\ \frac{5}{2} & 3 & \frac{7}{2} & 3 & 2 \\ -\frac{5}{2} & -\frac{3}{2} & -\frac{3}{2} & -1 & -1 \\ \frac{9}{2} & \frac{5}{2} & \frac{3}{2} & \frac{1}{2} & \frac{1}{2} \end{bmatrix} $$ Its characteristic polynomial is, computed with sage,
This implies that, determined by the first five values of each of the sequences $(a_n)$, $(b_n)$, $(c_n)$, $(d_n)$, $(e_n)$, all other values are a linear combination of the expressions $$ (1/2)^n\ ,\ n(1/2)^n\ ,\ n^2(1/2)^n\ ;\ i^n\ ,\ (-i)^n\ . $$ In particular, each of the five sequences satisfies a linear recursion given by (the coefficients of) the characteristic polynomial of $A$.
Note: The "accidental relation" satisfied by $(a_n)$ depends on the initial values.