Related papers: The Binomial Coefficient as an (In)finite Sum of S…
Binomial coefficients have been used for centuries in a variety of fields and have accumulated numerous definitions. In this paper, we introduce a new way of defining binomial coefficients as repeated sums of ones. A multitude of binomial…
We consider binomial and inverse binomial sums at infinity and rewrite them in terms of a small set of constants, such as powers of $\pi$ or $\log(2)$. In order to perform these simplifications, we view the series as specializations of…
The object of this paper is to generalize a theorem on the binomial coefficient [4] to the case in an arithmetic progression. We will also give a slightly stronger result than Langevin's [2].
We consider a class of generalized binomials emerging in fractional calculus. After establishing some general properties, we focus on a particular yet relevant case, for which we provide several ready-for-use combinatorial identities,…
A generating function for reciprocal binomial coefficients is written down, integral representations of this function are obtained, generating functions for sums of reciprocal binomial coefficients are derived, new identities are obtained,…
In this paper we present a special formula for transforming integrals to series. The resulting series involves binomial transforms with the Taylor coefficients of the integrand. Five applications are provided for evaluating challenging…
By polynomial (or extended binomial) coefficients, we mean the coefficients in the expansion of integral powers, positive and negative, of the polynomial $1+t +\cdots +t^{m}$; $m\geq 1$ being a fixed integer. We will establish several…
We give an exact coefficients formula of any infinite product of power series with constant term equal to $1$, by using structures from partitions of integers and permutation groups. This is an universal theorem for various of Binomial-type…
The definition of the binomial coefficient in terms of gamma functions also allows non-integer arguments. For nonnegative integer arguments the gamma functions reduce to factorials, leading to the well-known Pascal triangle. Using a…
By dividing hypergeometric series representations of the inverse sine by sin^-1 (x) and integrating, new double series representations of integers and constants arise. Binomial coefficients and the sine integral are thus combined in double…
Multiple binomial sums form a large class of multi-indexed sequences, closed under partial summation, which contains most of the sequences obtained by multiple summation of products of binomial coefficients and also all the sequences with…
The Simpson's formula is obtained by approximating the integral of a function on some interval by the integral of the quadratic polynomial determined by the function. However, a multidimensional analogue of the formula has not been given as…
We give a combinatorial proof of a formula giving the partial sums of the $k$-bonacci sequence as alternating sums of powers of two multiplied by binomial coefficients. As a corollary we obtain a formula for the $k$-bonacci numbers.
Given two infinite sequences with known binomial transforms, we compute the binomial transform of the product sequence. Various identities are obtained and numerous examples are given involving sequences of special numbers: Harmonic…
As is well-known, a generalization of the classical concept of the factorial $n!$ for a real number $x\in {\mathbb R}$ is the value of Euler's gamma function $\Gamma(1+x)$. In this connection, the notion of a binomial coefficient naturally…
We state a general formula for the number of binomial coefficients $n$ choose $k$ that are divided by a fixed power of a prime $p$, i.e., the number of binomial coefficients divided by $p^j$ and not divided by $p^{j+1}$.
We pose the question of what is the best generalization of the factorial and the binomial coefficient. We give several examples, derive their combinatorial properties, and demonstrate their interrelationships. On cherche ici \`a…
A generalized central trinomial coefficient $T_n(b,c)$ is the coefficient of $x^n$ in the expansion of $(x^2+bx+c)^n$ with $b,c\in\mathbb Z$. In this paper we investigate congruences and series for sums of terms related to central binomial…
We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…
The Fibonacci number is the residue of a rational function, from which follows that Fibonacci number summation identities can be derived with the integral representation method, a method also used to derive combinatorial identities. A…