  We prove a generalization of the digital binomial theorem by constructing a
one-parameter subgroup of generalized Sierpinski matrices. In addition, we
derive new formulas for the coefficients of Prouhet-Thue-Morse polynomials and
describe group relations satisfied by generating matrices defined in terms of
these Sierpinski matrices.
