On the number of odd binomial coefficients

DOI10.1007/BF00052108zbMath0869.11015WikidataQ114234161 ScholiaQ114234161MaRDI QIDQ1917184

Gerhard Larcher

Publication date: 1 September 1997

Published in: Acta Mathematica Hungarica (Search for Journal in Brave)

zbMATH Keywords

algorithmPascal's triangleSturmian sequencesum-of-digit functionnumber of odd trinomial coefficients

Mathematics Subject Classification ID

Binomial coefficients; factorials; (q)-identities (11B65) Radix representation; digital problems (11A63) Special sequences (11K31)

Related Items (4)

On the number of optimal base 2 representations of integers ⋮ Token graphs ⋮ The derivative of Minkowski's \(?(x)\) function ⋮ On a function related of multinomial coefficients. I.

Cites Work

• A summation formula related to the binary digits
• Exponential sums of sum-of-digit functions
• Mellin transforms and asymptotics: Digital sums
• Number of Odd Binomial Coefficients
• Power and Exponential Sums of Digital Sums Related to Binomial Coefficient Parity

This page was built for publication: On the number of odd binomial coefficients