Jumping succession rules and their generating functions

We study a generalization of the concept of succession rule, called jumping succession rule, where each label is allowed to produce its sons at different levels, according to the production of a fixed succession rule. By means of suitable linear algebraic methods, we obtain simple closed forms for the numerical sequences determined by such rules and give applications concerning classical combinatorial structures. Some open problems are proposed at the end of the paper.