Number of Odd Binomial Coefficients

DOI10.2307/2041936zbMath0323.10043OpenAlexW4246162778MaRDI QIDQ4085825

Heiko Harborth

Publication date: 1977

Full work available at URL: https://doi.org/10.2307/2041936

zbMATH Keywords

Pascal trianglefirst n rowsnumber of odd numbers

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Binomial coefficients; factorials; (q)-identities (11B65)

Related Items (13)

An explicit formula of the exponential sums of digital sums ⋮ Exponential Sums Related to Binomial Coefficient Parity ⋮ On the number of odd binomial coefficients ⋮ Equidistribution and Brownian motion on the Sierpiński gasket ⋮ Token graphs ⋮ Computing Minimum Length Representations of Sets of Words of Uniform Length ⋮ Universal and near-universal cycles of set partitions ⋮ Power and exponential sums for generalized coding systems by a measure theoretic approach ⋮ On a function related of multinomial coefficients. I. ⋮ A summation formula related to the binary digits ⋮ Reducing multinomial coefficients modulo a prime power ⋮ Mellin transforms and asymptotics: Digital sums ⋮ Computing minimum length representations of sets of words of uniform length

Cites Work

• Unnamed Item
• Notes on Binomial Coefficients Iii-Any Integer Divides Almost All Binomial Coefficients†
• Power and Exponential Sums of Digital Sums Related to Binomial Coefficient Parity
• Binomial Coefficients Modulo a Prime

This page was built for publication: Number of Odd Binomial Coefficients