Search Results for ""

A sequence {x_n} is called an infinitive sequence if, for every i, x_n=i for infinitely many n. Write a(i,j) for the jth index n for which x_n=i. Then as i and j range ...

The lower-trimmed subsequence of x={x_n} is the sequence V(x) obtained by subtracting 1 from each x_n and then removing all 0s. If x is a fractal sequence, then V(x) is a ...

An integer sequence given by the recurrence relation a(n)=a(a(n-2))+a(n-a(n-2)) with a(1)=a(2)=1. The first few values are 1, 1, 2, 3, 3, 4, 5, 6, 6, 7, 7, 8, 9, 10, 10, 11, ...

A sequence defined from a finite sequence a_0, a_1, ..., a_n by defining a_(n+1)=max_(i)(a_i+a_(n-i)).

A Meeussen sequence is an increasing sequence of positive integers (m_1, m_2, ...) such that m_1=1, every nonnegative integer is the sum of a subset of the {m_i}, and each ...

A sequence defined from a finite sequence a_0, a_1, ..., a_n by defining a_(n+1)=mex_(i)(a_i+a_(n-i)), where mex is the mex (minimum excluded value).

An extension to the Berlekamp-Massey algorithm which applies when the terms of the sequences are integers modulo some given modulus m.

The sequence of binary digits of the Thue constant, 0.110110111110110111110110110..._2 (OEIS A014578). A recurrence plot of the limiting value of this sequence is illustrated ...

A tournament sequence is an increasing sequence of positive integers (t_1, t_2, ...) such that t_1=1 and t_(i+1)<=2t_i. Cook and Kleber (2000) show that Meeussen sequences ...

An ultrametric is a metric which satisfies the following strengthened version of the triangle inequality, d(x,z)<=max(d(x,y),d(y,z)) for all x,y,z. At least two of d(x,y), ...