Search Results for ""

A sequence {a_j} of positive integers is called an iteration sequence if there exists a strictly increasing sequence {s_k} of positive integers such that a_1=s_1>=2 and ...

The sequence composed of 1s and 2s obtained by starting with the number 1, and picking subsequent elements to avoid repeating the longest possible substring. The first few ...

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 unimodal sequence is a finite sequence that first increases and then decreases. A sequence {s_1,s_2,...,s_n} is unimodal if there exists a t such that s_1<=s_2<=...<=s_t ...

A sequence s_n(x) is called a Sheffer sequence iff its generating function has the form sum_(k=0)^infty(s_k(x))/(k!)t^k=A(t)e^(xB(t)), (1) where A(t) = A_0+A_1t+A_2t^2+... ...

The EKG sequence is the integer sequence having 1 as its first term, 2 as its second, and with each succeeding term being the smallest number not already used that shares a ...

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

Given an infinitive sequence {x_n} with associative array a(i,j), then {x_n} is said to be a fractal sequence 1. If i+1=x_n, then there exists m<n such that i=x_m, 2. If h<i, ...

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. If s_n(x) is an associated ...

Given an undirected graph, a degree sequence is a monotonic nonincreasing sequence of the vertex degrees (valencies) of its graph vertices. The number of degree sequences for ...