Summary: Formulas are obtained for the determinants of certain matrices whose entries are zero and either binomial coefficients or their negatives. A consequence is that, for all integers \(n \geq 2\) and \(k\geq 2\), there exists an \((n-1)(k-1)\times (n-1)(k-1)\) matrix \(M(n, k)\) whose entries are the alternating binomial coefficients \((-1)^{j+1}\) and zeros such that \(\det(M(n,k))=\pm k^{t_{n-1}}\), where \(t_{n-1}\) is the \((n-1)\)th triangular number. Further, if we form the infinite matrix \(\mathcal P\) whose \(k\)th row is \[ \undersetbrace t-1\to{0\cdots0} -\binom{n}{0}\;\binom{n}{1} \cdots (-1)^{n+1}\binom{n}{n} \undersetbrace s-t\to{0\cdots0}, \] then each of the above mentioned determinants is, up to sign, the determinant of an \(n \times n\) submatrix \(A\) of \(\mathcal P\) obtained by selecting the initial \(n\) columns, and some choice of \(n\) rows of \(\mathcal P\). The matrices \(M(n,k)\), and others that we will consider also have the unexpected property that \(\det(|M(n,k)|) = |\det(M(n,k))|\), where \(|M|\) denotes the matrix obtained from \(M\) by replacing each entry with its absolute value.