OFFSET
0,3
LINKS
Eric Rowland, Binomial Coefficients, Valuations, and Words, In: Charlier É., Leroy J., Rigo M. (eds) Developments in Language Theory, DLT 2017, Lecture Notes in Computer Science, vol 10396.
Lukas Spiegelhofer and Michael Wallner, An explicit generating function arising in counting binomial coefficients divisible by powers of primes, arXiv:1604.07089 [math.NT], 2016.
Lukas Spiegelhofer and Michael Wallner, Divisibility of binomial coefficients by powers of two, arXiv:1710.10884 [math.NT], 2017.
EXAMPLE
For n=2, the number of integers m such that binomial(k,m) is divisible by 2^n but not by 2^(n+1) is given by 2^X_1 (-1/8 X_10 + 1/8 X_10^2 + X_100 + 1/4 X_110), where X_w is the number of occurrences of the word w in the binary representation of k. The polynomial factor of this expression has a(2) = 4 nonzero terms. - Eric Rowland, Mar 05 2017
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Michel Marcus, Nov 12 2016
EXTENSIONS
a(12)-a(16) from Eric Rowland, Mar 20 2017
STATUS
approved