A counting function generalizing binomial coefficients and some other classes of integers
J. Integer Seq. 17(3), Article 14.3.5, 23 p., electronic only (2014)
Summary
Summary: We define a counting function that is related to the binomial coefficients. For this function, we derive an explicit expression. In some particular cases, we prove simpler explicit formulae. We also derive a formula for the number of (0,1)-matrices, having a fixed number of 1's, and having no zero rows and zero columns. Further, we show that our function satisfies several recurrence relations.
