TOPICS
Search

Search Results for ""


3561 - 3570 of 13134 for binomial theorySearch Results
A sequence of positive integers 1<=a_1<a_2<a_3<... (1) is a nonaveraging sequence if it contains no three terms which are in an arithmetic progression, i.e., terms such that ...
O_h is the point group of symmetries of the octahedron having order 48 that includes inversion. It is also the symmetry group of the cube, cuboctahedron, and truncated ...
A figurate number which is the sum of two consecutive pyramidal numbers, O_n=P_(n-1)+P_n=1/3n(2n^2+1). (1) The first few are 1, 6, 19, 44, 85, 146, 231, 344, 489, 670, 891, ...
The odd divisor function sigma_k^((o))(n)=sum_(d|n; d odd)d^k (1) is the sum of kth powers of the odd divisors of a number n. It is the analog of the divisor function for odd ...
Odd values of Q(n) are 1, 1, 3, 5, 27, 89, 165, 585, ... (OEIS A051044), and occur with ever decreasing frequency as n becomes large (unlike P(n), for which the fraction of ...
A perfect cuboid is a cuboid having integer side lengths, integer face diagonals d_(ab) = sqrt(a^2+b^2) (1) d_(ac) = sqrt(a^2+c^2) (2) d_(bc) = sqrt(b^2+c^2), (3) and an ...
A permutation group is a finite group G whose elements are permutations of a given set and whose group operation is composition of permutations in G. Permutation groups have ...
A pair of elements (p_i,p_j) is called an inversion in a permutation p if i>j and p_i<p_j (Skiena 1990, p. 27; Pemmaraju and Skiena 2003, p. 69). For example, in the ...
A very general theorem that allows the number of discrete combinatorial objects of a given type to be enumerated (counted) as a function of their "order." The most common ...
The sequence {|_(3/2)^n_|} is given by 1, 1, 2, 3, 5, 7, 11, 17, 25, 38, ... (OEIS A002379). The first few composite |_(3/2)^n_| occur for n=8, 9, 10, 11, 12, 13, 14, 15, 16, ...
1 ... 354|355|356|357|358|359|360 ... 1314 Previous Next

...