Search Results for ""
361 - 370 of 2037 for Alternating Binomial SumSearch Results
Also known as "Laplacian" determinant expansion by minors, expansion by minors is a technique for computing the determinant of a given square matrix M. Although efficient for ...
The number of nonassociative n-products with k elements preceding the rightmost left parameter is F(n,k) = F(n-1,k)+F(n-1,k-1) (1) = (n+k-2; k)-(n+k-1; k-1), (2) where (n; k) ...
A lattice path from one point to another is p-good if it lies completely below the line y=(p-1)x. (1) Hilton and Pederson (1991) show that the number of p-good paths from (1, ...
Let I(G) denote the set of all independent sets of vertices of a graph G, and let I(G,u) denote the independent sets of G that contain the vertex u. A fractional coloring of ...
The Balaban index J is a graph index defined for a graph on n nodes, m edges, and c connected components by J=m/(gamma+1)sum_((i,j) in E(G))(D_iD_j)^(-1/2), where gamma=m-n+c ...
Let a convex cyclic polygon be triangulated in any manner, and draw the incircle to each triangle so constructed. Then the sum of the inradii is a constant independent of the ...
A Smith number is a composite number the sum of whose digits is the sum of the digits of its prime factors (excluding 1). (The primes are excluded since they trivially ...
Polynomials M_k(x) which form the associated Sheffer sequence for f(t)=(e^t-1)/(e^t+1) (1) and have the generating function sum_(k=0)^infty(M_k(x))/(k!)t^k=((1+t)/(1-t))^x. ...
A stack polyomino is a self-avoiding convex polyomino containing two adjacent corners of its minimal bounding rectangle. The number of stack polyominoes with perimeter 2n+4 ...
The exponential function has two different natural q-extensions, denoted e_q(z) and E_q(z). They are defined by e_q(z) = sum_(n=0)^(infty)(z^n)/((q;q)_n) (1) = _1phi_0[0; ...
...
View search results from all Wolfram sites (31754 matches)

