Latin squares are notoriously complicated and difficult to enumerate. Thus, in this paper
we discuss the combinatorics of a single row instead of asking about the entire puzzle. We
give formal definitions and provide examples in Section 2. In Section 3 we give formulas for
skyscraper numbers and in Section 4 we define the skyscraper sequence. In Section 5 we
prove some properties of skyscraper numbers and the skyscraper sequence.