Schröder triangles, paths, and parallelogram polyominoes

This paper considers combinatorial interpretations for two triangular recurrence arrays containing the Schröder numbers s_n - 1, 1, 3, 11, 45, 197,... and r_n = 1, 2, 6, 22, 90, 394,..., for n = 0, 1, 2,.... These interpretations involve the enumeration of constrained lattice paths and bicolored parallelogram polyominoes, called zebras. In addition to two recent inductive constructions of zebras, and their associated generating trees, we present two new ones and a bijection between zebras and constrained lattice paths. We use the constructions with generating function methods to count sets of zebras with respect to natural parameters.