ABSTRACT

Sequences of integers occur regularly in combinatorial applications. For example, the solution to a counting problem that depends on a parameter k can be viewed as the kth term of a sequence. This chapter provides a guide to particular sequences that arise in applied settings. Such (infinite) sequences can frequently be represented in a finite form. Specifically, sequences can be expressed using generating functions, recurrence relations, or by an explicit formula for the kth term of the sequence.