Search Results for ""

The first Strehl identity is the binomial sum identity sum_(k=0)^n(n; k)^3=sum_(k=0)^n(n; k)^2(2k; n), (Strehl 1993, 1994; Koepf 1998, p. 55), which are the so-called Franel ...

A formula for the generalized Catalan number _pd_(qi). The general formula is (n-q; k-1)=sum_(i=1)^k_pd_(qi)(n-pi; k-i), where (n; k) is a binomial coefficient, although ...

sum_(k=-infty)^infty(a; m-k)(b; n-k)(a+b+k; k)=(a+n; m)(b+m; n).

The Christmas stocking theorem, also known as the hockey stick theorem, states that the sum of a diagonal string of numbers in Pascal's triangle starting at the nth entry ...

sum_(1<=k<=n)(n; k)((-1)^(k-1))/(k^m)=sum_(1<=i_1<=i_2<=...<=i_m<=n)1/(i_1i_2...i_m), (1) where (n; k) is a binomial coefficient (Dilcher 1995, Flajolet and Sedgewick 1995, ...

The Franel numbers are the numbers Fr_n=sum_(k=0)^n(n; k)^3, (1) where (n; k) is a binomial coefficient. The first few values for n=0, 1, ... are 1, 2, 10, 56, 346, ... (OEIS ...

The numbers B_(n,k)(1!,2!,3!,...)=(n-1; k-1)(n!)/(k!), where B_(n,k) is a Bell polynomial.

The n-roll mill curve is given by the equation x^n-(n; 2)x^(n-2)y^2+(n; 4)x^(n-4)y^4-...=a^n, where (n; k) is a binomial coefficient.

The number of multisets of length k on n symbols is sometimes termed "n multichoose k," denoted ((n; k)) by analogy with the binomial coefficient (n; k). n multichoose k is ...

The multinomial coefficients (n_1,n_2,...,n_k)!=((n_1+n_2+...+n_k)!)/(n_1!n_2!...n_k!) (1) are the terms in the multinomial series expansion. In other words, the number of ...