Pascal's triangle (mod 8) (Q1378294)

The authors prove formulae for the number of binomial coefficients in the \(n\)th row of Pascal's triangle which are \(\equiv a \pmod 8\), for each \(a\), in terms of the number of occurrences of various digit patterns in the binary expansion of \(n\). Such a phenomena was first observed by the reviewer [Am. Math. Mon. 99, No. 4, 318-331 (1992; Zbl 0757.05003)] when \(a\) is odd, developing results via the self-similar features of Pascal's triangle, whereas the current authors work with explicit formulae of \textit{K. S. Davis} and \textit{W. A. Webb} [Fibonacci Q. 29, No. 1, 79-83 (1991; Zbl 0732.11009)], (and correct some neglectful errors in the reviewer's work, though see also \textit{A. Granville} [Am. Math. Mon. 104, No. 9, 848-851 (1997; Zbl 0889.05002)]).