A symbolic evaluation of determinants of matrices with recursive entries (Q1014074)

For a matrix \(A\) whose entries are given by specific recurrence relations of its first row and first column entries, the authors show that \(A\) can be factored as \(L\cdot U\) with a lower and upper triangular matrix. For several specified Fibonacci like recurrences the entries in \(L\) and \(U\) satisfy related recurrences that allow \(\det(A)\) to be evaluated symbolically for any dimension \(n\) of \(A\).