The kernel method and systems of functional equations with several conditions

We generalize the kernel method to equation systems in which the number of unknowns is allowed to exceed the number of equations. With this generalization, we derive the generating functions for several kinds of sequences and generating trees whose recursions are dependent on the parity of the indices.