Recurrence relations with two indices and even trees

Recently, the author, Mansour, introduced a combinatorial problem, called Hobby's problem, to study different types of recurrence relations with two indices. Moreover, he presented several recurrence relations with two indices related to Dyck paths and Schröder paths. In this paper, we generalize Hobby's problem to study other types of recurrence relations with two indices for which a combinatorial method provides a complete solution. Combinatorially, we describe these recurrence relations as a set of lattice paths in the second octant of the plane integer lattice, and then we map bijectively these lattice paths to the set of even trees. Analytically, we use the kernel method technique to solve these recurrence relations.