14 citations · 87 across the 22 of their papers we have counts for
Showing math.NTShow all
3 papers · 1 filter
math.NT2020
The binary digits of n+t
Lukas Spiegelhofer, Michael Wallner
The binary sum-of-digits function counts the number of ones in the binary expansion of a nonnegative integer. For any nonnegative integer , T.~W.~Cusick defined the asymptot…
math.NT2017★ 1 cited
Divisibility of binomial coefficients by powers of two
Lukas Spiegelhofer, Michael Wallner
For nonnegative integers and let be the number of entries in the -th row of Pascal's triangle that are not divisible by . In this paper we prove that t…
math.NT2016★ 2 cited
An explicit generating function arising in counting binomial coefficients divisible by powers of primes
Lukas Spiegelhofer, Michael Wallner
For a prime and nonnegative integers and let be the number of entries in the -th row of Pascal's triangle that are exactly divisible by . Mor…