Search Results for ""

A string or word is said to be admissible if that word appears in a given sequence. For example, in the sequence aabaabaabaabaab..., a, aa, baab are all admissible, but bb is ...

The map H_n(X,A)->H_(n-1)(A) appearing in the long exact sequence of a pair axiom.

A binary plot of an integer sequence is a plot of the binary representations of successive terms where each term is represented as a column of bits with 1s colored black and ...

Fractran is an algorithm applied to a given list f_1, f_2, ..., f_k of fractions. Given a starting integer N, the FRACTRAN algorithm proceeds by repeatedly multiplying the ...

A generalized Vandermonde matrix of two sequences a and b where a is an increasing sequence of positive integers and b is an increasing sequence of nonnegative integers of ...

Let b_1=1 and b_2=2 and for n>=3, let b_n be the least integer >b_(n-1) which can be expressed as the sum of two or more consecutive terms. The resulting sequence is 1, 2, 3, ...

Given a sequence of real numbers a_n, the infimum limit (also called the limit inferior or lower limit), written lim inf and pronounced 'lim-inf,' is the limit of ...

A map which uses a set of rules to transform elements of a sequence into a new sequence using a set of rules which "translate" from the original sequence to its ...

The Banach-Saks theorem is a result in functional analysis which proves the existence of a "nicely-convergent" subsequence for any sequence {f_n}={f_n}_(n in Z^*) of ...

A recurrence equation (also called a difference equation) is the discrete analog of a differential equation. A difference equation involves an integer function f(n) in a form ...