0 votes 0 votes Use question $48$ to solve the recurrence relation $(n + 1)a_{n} = (n + 3)a_{n-1} + n, \:\text{for}\: n \geq 1, \:\text{with}\: a_{0} = 1$ Combinatory kenneth-rosen discrete-mathematics counting recurrence-relation descriptive + – admin asked May 6, 2020 admin 220 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.