Search Results for ""

A generalization of the Fibonacci numbers defined by the four constants (p,q,r,s) and the definitions H_0=p and H_1=q together with the linear recurrence equation ...

A generalization of an Ulam sequence in which each term is the sum of two earlier terms in exactly s ways. (s,t)-additive sequences are a further generalization in which each ...

A sequence a_1, a_2, ... such that the metric d(a_m,a_n) satisfies lim_(min(m,n)->infty)d(a_m,a_n)=0. Cauchy sequences in the rationals do not necessarily converge, but they ...

A sequence of n-tuples that fills n-space more uniformly than uncorrelated random points, sometimes also called a low-discrepancy sequence. Although the ordinary uniform ...

The sequence a(n) given by the exponents of the highest power of 2 dividing n, i.e., the number of trailing 0s in the binary representation of n. For n=1, 2, ..., the first ...

The integer sequence beginning with a single digit in which the next term is obtained by describing the previous term. Starting with 1, the sequence would be defined by "1, ...

Consider the recurrence equation defined by a_0=m and a_n=|_sqrt(2a_(n-1)(a_(n-1)+1))_|, (1) where |_x_| is the floor function. Graham and Pollak actually defined a_1=m, but ...

Consider the Fibonacci-like recurrence a_n=+/-a_(n-1)+/-a_(n-2), (1) where a_0=0, a_1=1, and each sign is chosen independently and at random with probability 1/2. ...

Given two starting numbers (a_1,a_2), the following table gives the unique sequences {a_i} that contain no three-term arithmetic progressions. Sloane sequence A003278 1, 2, ...

Define F(1)=1 and S(1)=2 and write F(n)=F(n-1)+S(n-1), where the sequence {S(n)} consists of those integers not already contained in {F(n)}. For example, F(2)=F(1)+S(1)=3, so ...