Consider the problem of computing a[k] given a[0], a[1], and k, where a[k] = k^2 a[k-1] + k^3 a[k-2] for all k >= 2. Express a[k] in terms of a[0], a[1], and a product of k small matrices: more precisely, 2x2 matrices with small integer entries.