This site is supported by donations to The OEIS Foundation.

# Growth of sequences

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

${\displaystyle \scriptstyle a(n)\,\in \,O\left(1\right).}$

Sequences for which there is an ${\displaystyle \scriptstyle N}$ with ${\displaystyle \scriptstyle -N\,\leq \,a(n)\,\leq \,N}$ for all ${\displaystyle \scriptstyle n}$. 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 ${\displaystyle \scriptstyle k}$ such that ${\displaystyle \scriptstyle a(n)\,=\,a(n+k)}$ for all ${\displaystyle \scriptstyle n}$ (or for all ${\displaystyle \scriptstyle n\,>\,N}$ for eventually periodic).

The native denominator in the generating functions of these is ${\displaystyle \scriptstyle 1-x^{k}}$, 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 ${\displaystyle \scriptstyle k}$ of the denominator polynomial, and this simple recurrence becomes some other product of cyclotomic polynomials in ${\displaystyle \scriptstyle x}$.

#### Constant

Sequences for which there is a ${\displaystyle \scriptstyle k}$ such that ${\displaystyle \scriptstyle a(n)\,=\,k}$ for all ${\displaystyle \scriptstyle n}$ (or for all ${\displaystyle \scriptstyle n\,>\,N}$ for eventually constant).

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

## Subpolynomial

### Iterated logarithmic

Sequences for which there are ${\displaystyle \scriptstyle 0\,<\,\alpha \,<\,\beta \,}$ with ${\displaystyle \scriptstyle \alpha \,\log ^{*}(n)\,\leq \,a(n)\,\leq \,\beta \,\log ^{*}(n)\,}$ with ${\displaystyle \scriptstyle \log ^{*}(x)\,=\,0\,}$ if ${\displaystyle \scriptstyle x\,\leq \,0\,}$ and ${\displaystyle \scriptstyle \log ^{*}(x)\,=\,\log ^{*}(\log x)+1\,}$ otherwise.

## Polynomial

${\displaystyle a(n)\in \bigcup _{k}O(n^{k})\cap \bigcup _{k>0}\Omega (n^{k})}$

Sequences with polynomial growth: those for which ${\displaystyle \scriptstyle n^{\alpha }\,\leq \,a(n)\,\leq \,n^{\beta }\,}$ for some ${\displaystyle \scriptstyle 0\,<\,\alpha \,<\,\beta \,}$ and all large ${\displaystyle \scriptstyle n.\,}$

### Sublinear

This includes sequences with ${\displaystyle n^{\alpha } for some ${\displaystyle 0<\alpha <\beta <1}$ and large enough n. For example, sequences which grow as ${\displaystyle \Theta ({\sqrt {n}}).}$ Listed below are some sequences with ${\displaystyle n^{\alpha -\varepsilon } for all ${\displaystyle \varepsilon >0}$ and large enough n.

#### Exponent 1

These are sequences are sublinear yet grow faster than ${\displaystyle n^{e}}$ for any ${\displaystyle e<1}$: ${\displaystyle n^{1-\varepsilon } for all ${\displaystyle k,\varepsilon >0}$ and large enough n.

### Linear

${\displaystyle \scriptstyle a(n)\,\in \,O\left(n\right).\,}$

Sequences where each ${\displaystyle \scriptstyle a(n)\,=\,a(n-1)+c,\,}$ called arithmetic sequences. For example: A085959, in which ${\displaystyle \scriptstyle c\,}$ = 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.

${\displaystyle a(n)\in \omega \left(n\right)\cap o\left(n^{2}\right)}$

${\displaystyle \scriptstyle a(n)\,\in \,O\left(n^{2}\right).\,}$

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:

${\displaystyle \scriptstyle a(n)\,\in \,O\left(n^{k}\right),\,2\,<\,k\,<\,3.\,}$

E.g. ${\displaystyle \scriptstyle a(n)\,\in \,O\left(n^{2}\log n\right)\,\subset \,O\left(n^{2+\epsilon }\right).\,}$

### Cubic

${\displaystyle \scriptstyle a(n)\,\in \,O\left(n^{3}\right).\,}$

#### Supercubic but subquartic

${\displaystyle \scriptstyle a(n)\,\in \,O\left(n^{k}\right),\,3\,<\,k\,<\,4.\,}$

E.g. ${\displaystyle \scriptstyle a(n)\,\in \,O\left(n^{3}\log n\right)\,\in \,O\left(n^{3+\epsilon }\right).\,}$

### Quartic

${\displaystyle \scriptstyle a(n)\,\in \,O\left(n^{4}\right).\,}$

## Sub-exponential but superpolynomial

Sequences for which ${\displaystyle \scriptstyle n^{\alpha }\,<\,a(n)\,}$ for all ${\displaystyle \scriptstyle \alpha \,}$ and all large ${\displaystyle \scriptstyle n(\alpha ),\,}$ but for which ${\displaystyle \scriptstyle a(n)\,<\,\alpha ^{n}\,}$ for all ${\displaystyle \scriptstyle \alpha \,>\,1\,}$ and all large ${\displaystyle \scriptstyle n(\alpha ).\,}$

## Exponential

Sequences for which ${\displaystyle \scriptstyle \alpha ^{n}\leq a(n)\leq \beta ^{n}}$ for some ${\displaystyle \scriptstyle 1<\alpha \leq \beta }$ and all large ${\displaystyle \scriptstyle n.}$

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, ${\displaystyle \scriptstyle \alpha <\beta }$, 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 ${\displaystyle \scriptstyle \alpha ^{n} for all ${\displaystyle \scriptstyle \alpha >1}$ and sufficiently large ${\displaystyle \scriptstyle n(\alpha ),}$ but ${\displaystyle \scriptstyle a(n)<\alpha \uparrow ^{2}n}$ for all ${\displaystyle \scriptstyle \alpha >e^{1/e}}$ and sufficiently large ${\displaystyle \scriptstyle n(\alpha ).}$

### Doubly-exponential

Sequences for which ${\displaystyle \scriptstyle \exp {\left(\alpha ^{n}\right)}\,\leq \,a(n)\,\leq \,\exp {\left(\beta ^{n}\right)}\,}$ for some ${\displaystyle \scriptstyle 1\,<\,\alpha \,\leq \,\beta \,}$ and all large ${\displaystyle \scriptstyle n\,}$.

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

### Elementary, but super-doubly-exponential

Sequences for which ${\displaystyle \scriptstyle \exp {\left(\alpha ^{n}\right)} for all ${\displaystyle \scriptstyle \alpha }$ and all large enough ${\displaystyle \scriptstyle n(\alpha ),}$ but for which ${\displaystyle \scriptstyle a(n)<\exp _{k}{\left(\alpha ^{n}\right)}}$ for some k, where ${\displaystyle \scriptstyle \exp _{k}}$ is the k-times iterated exponential. Informally, these are towers with fixed height (see ELEMENTARY).

### Nonelementary, but sub-tetrational

Sequences for which for which ${\displaystyle \scriptstyle \exp _{k}{\left(\alpha ^{n}\right)} for all k and large ${\displaystyle \scriptstyle n(k),\,}$ but for which ${\displaystyle \scriptstyle a(n)<\alpha \uparrow ^{2}n}$ for all ${\displaystyle \scriptstyle \alpha >e^{1/e}}$ and sufficiently large ${\displaystyle \scriptstyle n(\alpha ).}$

No sequences in the OEIS are known to have this behavior, but see Chazelle 2009[1] for an example of a sequence with behavior ${\displaystyle \scriptstyle 2\uparrow ^{2}\Theta (\log n).}$

### Iterated exponential and super-iterated exponential

#### Tetrational

Sequences for which ${\displaystyle \scriptstyle \alpha \,\uparrow ^{2}\,n\,\leq \,a(n)\,\leq \,\beta \,\uparrow ^{2}\,n\,}$ for some ${\displaystyle \scriptstyle e^{1/e}\,<\,\alpha \,\leq \,\beta \,}$ and all large ${\displaystyle \scriptstyle n\,}$. Informally, ${\displaystyle \scriptstyle n\,}$ gives the height of the exponential tower.

Examples include:

#### Primitive recursive, but super-tetrational

Sequences for which ${\displaystyle \scriptstyle \alpha \,\uparrow ^{2}\,n\,<\,a(n)\,}$ for all ${\displaystyle \scriptstyle \alpha \,}$ and all large ${\displaystyle \scriptstyle n(\alpha ),\,}$ but for which there is a ${\displaystyle \scriptstyle k\,}$ with ${\displaystyle \scriptstyle a(n)\,\leq \,\alpha \,\uparrow ^{k}\,\,}$ for some ${\displaystyle \scriptstyle \alpha \,>\,e^{1/e}.\,}$

#### Not primitive recursive

Sequences for which ${\displaystyle \scriptstyle 2\,\uparrow ^{k}\,n\,<\,a(n)\,}$ for all ${\displaystyle \scriptstyle k\,}$ and large enough ${\displaystyle \scriptstyle n(k).\,}$

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.