This site is supported by donations to The OEIS Foundation.

# Ascending order

A sequence ${\displaystyle a}$ is in ascending order if each ${\displaystyle a(n)\leq a(n+1)}$ (save the last in the case of a finite sequence). There should be at least one instance of ${\displaystyle a(n). For example, the sequence of Fibonacci numbers (1, 1, 2, 3, 5, 8, 13, ...) is in ascending order.