TOPICS
Search

Search Results for ""


291 - 300 of 13134 for binomial theorySearch Results
Clark's triangle is a number triangle created by setting the vertex equal to 0, filling one diagonal with 1s, the other diagonal with multiples of an integer f, and filling ...
Let G be a group of group order h and D be a set of k elements of G. If the set of differences d_i-d_j contains every nonzero element of G exactly lambda times, then D is a ...
The exponential transform is the transformation of a sequence a_1, a_2, ... into a sequence b_1, b_2, ... according to the equation ...
Given an infinitive sequence {x_n} with associative array a(i,j), then {x_n} is said to be a fractal sequence 1. If i+1=x_n, then there exists m<n such that i=x_m, 2. If h<i, ...
A two-coloring of a complete graph K_n of n nodes which contains exactly the number of monochromatic forced triangles and no more (i.e., a minimum of R+B where R and B are ...
The Leibniz harmonic triangle is the number triangle given by 1/11/2 1/21/3 1/6 1/31/4 1/(12) 1/(12) 1/41/5 1/(20) 1/(30) 1/(20) 1/5 (1) (OEIS A003506), where each fraction ...
A finite sequence of real numbers {a_k}_(k=1)^n is said to be logarithmically concave (or log-concave) if a_i^2>=a_(i-1)a_(i+1) holds for every a_i with 1<=i<=n-1. A ...
11 11 1 11 2 2 11 2 4 2 11 3 6 6 3 11 3 9 10 9 3 11 4 12 19 19 12 4 11 4 16 28 38 28 16 4 11 5 20 44 66 66 44 20 5 11 5 25 60 110 126 110 60 25 5 1 (1) Losanitsch's triangle ...
The Narayan number N(n,k) for n=1, 2, ... and k=1, ..., n gives a solution to several counting problems in combinatorics. For example, N(n,k) gives the number of expressions ...
A real quantity having a value less than zero (<0) is said to be negative. Negative numbers are denoted with a minus sign preceding the corresponding positive number, i.e., ...
1 ... 27|28|29|30|31|32|33 ... 1314 Previous Next

...