Search Results for ""

The Earls sequence gives the starting position in the decimal digits of pi (or in general, any constant), not counting digits to the left of the decimal point, at which a ...

The Farey sequence F_n for any positive integer n is the set of irreducible rational numbers a/b with 0<=a<=b<=n and (a,b)=1 arranged in increasing order. The first few are ...

A sequence of real numbers {x_n} is equidistributed on an interval [a,b] if the probability of finding x_n in any subinterval is proportional to the subinterval length. The ...

A sequence s_n^((lambda))(x)=[h(t)]^lambdas_n(x), where s_n(x) is a Sheffer sequence, h(t) is invertible, and lambda ranges over the real numbers is called a Steffensen ...

A sequence of numbers V={nu_n} is said to be weakly complete if every positive integer n beyond a certain point N is the sum of some subsequence of V (Honsberger 1985). ...

A polynomial sequence p_n(x) is called the basic polynomial sequence for a delta operator Q if 1. p_0(x)=1, 2. p_n(0)=0 for all n>0, 3. Qp_n(x)=np_(n-1)(x). If p_n(x) is a ...

The sequence generated by the Levine-O'Sullivan greedy algorithm: 1, 2, 4, 6, 9, 12, 15, 18, 21, 24, 28, 32, 36, 40, 45, 50, 55, 60, 65, ... (OEIS A014011). The reciprocal ...

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 ...

Given a commutative unit ring R, and an R-module M, a sequence {x_1,...,x_n} of elements of R is called a regular sequence for M (or an M-sequence for short), if, for all ...

A short exact sequence of groups A, B, and C is given by two maps alpha:A->B and beta:B->C and is written 0->A->B->C->0. (1) Because it is an exact sequence, alpha is ...