{'fraction_non_alphanumeric': 0.02111801242236025, 'fraction_numerical': 0.0012422360248447205, 'mean_word_length': 4.840579710144928, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Determinants and Recurrence Sequences

We examine relationships between two minors of order n of some matrices of n rows and n + r columns. This is done through a class of determinants, here called n-determinants, the investigation of which is our objective. As a consequence of our main result we obtain a generalization of theorem of the product of two determinants. We show the upper Hessenberg determinants, with 1 on the subdiagonal, belong to our class. Using such determinants allow us to represent terms of various recurrence sequences in the form of determinants. We illustrate this with several examples. In particular, we state a few determinants, each of which equals a Fibonacci number. Also, several relationships among terms of sequences defined by the same recurrence equation are derived.