In answering a question myself I have ended up with a summation of the form: $$a_n=\frac{n(n+3)}{2}a_{n-1}+\frac{n(n+1)}{2}$$ I am unsure of how to solve this type of summation such that I have it in the form: $$a_n=f(a_0,n)$$ I know that problems of this form can be solved as I have seen it in the Fibonacci sequences and other cases but I am not sure how I go about doing this, I will link the original question here. Thanks!
Evidence of my attempt so far and how I got in this form can be found at the original question
EDIT:
I've found a formula here which talks about how to solve first order non-homogeneous recurrence relations, which states for a series in the form: $$a_{n+1}-f_na_n=g_n$$ we can say: $$a_n=\left(\prod_{k=0}^{n-1}f_k\right)\left(A_0+\sum_{m=0}^{n-1}\frac{g_m}{\prod_{k=0}^mf_k}\right)$$ So I will try to use this