Motivated by a question involving tournament brackets, we study the number W(N) of N-tuples satisfying a system of natural inequalities. Our analysis yields a doubly-indexed recurrence relation evoking Pascal's formula and an interesting sequence of polynomials. We provide upper and lower bounds for W(N) (which grows faster than exponentially) and methods for computing it.