in this talk, we introduce a new family of combinatorial objects called kepler walls. roughly speaking, a kepler wall is a wall built of bricks in which no two bricks are adjacent, and each brick below the top row is supported by a brick in the row above. despite their unlikely definition, kepler walls of unrestricted width are counted by binomial coefficients, as we will see by means of a constructive bijection. we will also see connections to other interesting and well-understood sequences, such as the catalan and fibonacci numbers.