Search Results for ""

The Sally sequence gives the sequence of lengths of the repetitions which are avoided in the Linus sequence. The first few terms are 0, 1, 1, 2, 1, 3, 1, 1, 3, 2, 1, 6, 3, 2, ...

Defined for samples x_i, i=1, ..., N by alpha_r=1/Nsum_(i=1)^Nz_i^r=(mu_r)/(sigma^r), (1) where z_i=(x_i-x^_)/(s_x). (2) The first few are alpha_1 = 0 (3) alpha_2 = 1 (4) ...

By the definition of the trigonometric functions, cos0 = 1 (1) cot0 = infty (2) csc0 = infty (3) sec0 = 1 (4) sin0 = 0 (5) tan0 = 0. (6)

A composite number n is a positive integer n>1 which is not prime (i.e., which has factors other than 1 and itself). The first few composite numbers (sometimes called ...

Schur's partition theorem lets A(n) denote the number of partitions of n into parts congruent to +/-1 (mod 6), B(n) denote the number of partitions of n into distinct parts ...

A set of m distinct positive integers S={a_1,...,a_m} satisfies the Diophantus property D(n) of order n (a positive integer) if, for all i,j=1, ..., m with i!=j, ...

An unordered factorization is a factorization of a number into a product of factors where order is ignored. The following table lists the unordered factorizations of the ...

The decimal expansion of the natural logarithm of 10 is given by ln10=2.302585092994045684... (1) (OEIS A002392). It is also given by the BBP-type formulas ln10 = (2) = ...

An acyclic graph is a graph having no graph cycles. Acyclic graphs are bipartite. A connected acyclic graph is known as a tree, and a possibly disconnected acyclic graph is ...

A number n is called an Egyptian number if it is the sum of the denominators in some unit fraction representation of a positive whole number not consisting entirely of 1s. ...