Fine, N. J. Binomial coefficients modulo a prime. (English) Zbl 0030.11102 Am. Math. Mon. 54, 589-592 (1947). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 4 ReviewsCited in 139 Documents Keywords:Number theory PDFBibTeX XMLCite \textit{N. J. Fine}, Am. Math. Mon. 54, 589--592 (1947; Zbl 0030.11102) Full Text: DOI Online Encyclopedia of Integer Sequences: Total number of odd entries in first n rows of Pascal’s triangle: a(0) = 0, a(1) = 1, a(2k) = 3*a(k), a(2k+1) = 2*a(k) + a(k+1). a(n) = Sum_{i=0..n-1} 2^wt(i).