Haupt, AlexanderAlexanderHaupt2021-04-202021-04-202021Journal of Integer Sequences 24 (3): 21.3.6 (2021)http://hdl.handle.net/11420/9335We first enumerate a generalization of domino towers that was proposed by Brown, which we call S-omino towers. We establish equations that the generating function must satisfy, and then apply the Lagrange inversion formula to find a closed formula for the number of towers. We also show a connection to generalized Dyck paths and describe an explicit bijection. Finally, we consider the set of row-convex k-omino towers, introduced by Brown, and calculate an exact generating function.en1530-7638Journal of integer sequences20213BijectionConvex polyominoDominoLagrange inversionEnumeration of s-omino towers and row-convex k-omino towersJournal ArticleOther