This site is supported by donations to The OEIS Foundation.

Growth of sequences

From OeisWiki
Jump to: navigation, search

This is a description of the rates of growth of sequences: bounded, not primitive recursive, and many things in-between like iterated logarithmic, tetrational, and polynomial. Note that not all sequences are included—sequences like A124625 with alternating growth do not fall into the classification below.

Bounded

Sequences for which there is an with for all . By definition this includes all sequences with keyword:cons (because these are the digits of a constant, and the digits have a fixed range depending only on the base used), but there are many other examples.


Conjectured:

Periodic

Sequences for which there is a such that for all (or for all for eventually periodic).

The native denominator in the generating functions of these is , which makes them traceable through the index to linear recurrences. If 1 is also a root of the numerator of the generating function, this may lower the degree of the denominator polynomial, and this simple recurrence becomes some other product of cyclotomic polynomials in .

Constant

Sequences for which there is a such that for all (or for all for eventually constant).

These are in the index to linear recurrences in the order 01, (1) category.

Subpolynomial

Unbounded but sub-iterated logarithmic

Iterated logarithmic

Sequences for which there are with with if and otherwise.

Super-iterated logarithmic but sub-doubly logarithmic

Doubly logarithmic

Super-doubly logarithmic but sublogarithmic

A099563 (inverse gamma growth, ~ log n/log log n)

Logarithmic

Superlogarithmic but subpolynomial

A010553 (exp(sqrt(log n)) or so)

Polynomial

Sequences with polynomial growth: those for which for some and all large

Sublinear

This includes sequences with for some and large enough n. For example, sequences which grow as Listed below are some sequences with for all and large enough n.

Exponent 1/3

Exponent 1/2

Exponent phi - 1

Exponent 1

These are sequences are sublinear yet grow faster than for any : for all and large enough n.

Linear

Sequences where each are called arithmetic sequences. For example: A085959, in which = 37. This includes all first-degree polynomials, which are found in the index to linear recurrences under order 02, (-2,1). It also includes non-polynomials of linear growth like A212445.

A strictly increasing sequence has linear growth if and only if its lower density is positive.

All Beatty sequences have linear growth (by definition).

Conjectured: A005279, A096399, A319630, A325160, A194186, A003147**, A127666, A129485, A070087, A070089, A293186, A112643, A348274, A194184, A348604

* Not a set

† Linear shift of a Beatty sequence

** Proved on the assumption of GRH.

Superlinear but subquadratic

Quasilinear

Quadratic

This includes all second-degree polynomials, which are found in the index to linear recurrences under order 03, (3,-3,1).

It also includes non-polynomials of quadratic growth:

Superquadratic but subcubic

E.g.

Cubic

Supercubic but subquartic

E.g.

Quartic

Sub-exponential but superpolynomial

Sequences for which for all and all large but for which for all and all large

Exponential

Sequences for which for some and all large

Sequences with rational generating functions with denominator (in lowest terms) which is not a cyclotomic polynomial have exponential growth. Equivalently, linear recurrence relations in which one of the roots of the characteristic polynomial has absolute value greater than 1.

Minimally superincreasing sequences have exponential growth (though some superincreasing sequences have superexponential growth).

Sequences are sorted by base, when possible. Ranges can represent either uncertainty about the value of the base, , or uncertainty about which of these cases hold. See the individual sequence entries for more details.

Superexponential

Superexponential but sub-doubly-exponential

Sequences for which for all and sufficiently large but for all and sufficiently large

Doubly-exponential

Sequences for which for some and all large .

Sequences of the form a(n+1) = a(n)^2 + ...

See the Index page.

These are questionable members: a strict definition would not admit them but some might. For example, the last term may be not just squared but multiplied by a constant.

Conjectural

Elementary, but super-doubly-exponential

Sequences for which for all and all large enough but for which for some k, where is the k-times iterated exponential. Informally, these are towers with fixed height (see ELEMENTARY).

Nonelementary, but sub-tetrational

Sequences for which for which for all k and large but for which for all and sufficiently large

No sequences in the OEIS are known to have this behavior, but see Chazelle 2009[1] for an example of a sequence with behavior

Iterated exponential and super-iterated exponential

Tetrational

Sequences for which for some and all large . Informally, gives the height of the exponential tower.

Examples include:

These are questionable members: a strict definition would not admit them but some might. For example, they might be comparable to a tetrational function with a non-constant base.

Primitive recursive, but super-tetrational

Sequences for which for all and all large but for which there is a with for some

Not primitive recursive

Sequences for which for all and large enough

Examples include:

Uncomputable

Sequences (like Busy Beavers) which are not computable. In particular, given some formal system, there is an index beyond which it is not possible to compute terms of the sequence, even if they are in principle finite.

See also

Notes

  1. Bernard Chazelle, The convergence of bird flocking (2009). Preliminary version presented at the 26th Annual Symposium on Computational Geometry, 2010.
  2. D. E. Knuth and N. J. A. Sloane, Correspondence, May 1970

External links

Cite this page as

Charles R Greathouse IV, Growth_of_sequences. — From the On-Line Encyclopedia of Integer Sequences® (OEIS®) wiki.Available at https://oeis.org/wiki/Growth_of_sequences