A sequence is said to be defined recursively if some initial values are specified and later terms of the sequence are defined by a number of earlier terms. Iteration is the method of calculating the successive values of a recursively defined sequence. We examine the applications of recursion in enumerating the number of computer codewords with specific properties, and in counting the number of ways flags of different colors and different sizes are arranged on a flagpole.
