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. The chapter lists the numerical values of various integer sequences, classified according to the type of combinatorial structure that produces the terms. The miniguide contains a selection of important sequences, grouped by functional problem area, such as graph theory, algebra, number theory. The sequences are listed in a logical, rather than lexicographic, order within each identifiable grouping.
