The subword complexity of an infinite word w is the function that sends each non-negative integer n to the number of distinct factors of length n. Note: this function does not count the number of distinct (scattered) subwords.

-- JeffreyShallit - 13 Jul 2011