In this paper, we are concerned with proving a formula for the computation of what is variously called the pattern inventory (e.g., see De Bruijn [2]) or the configuration counting series (e.g., see Harary [3]). Rather than redeveloping a large number of definitions, we shall assume the reader is already familiar with the terminology used by De Bruijn [2].
Polya, in a celebrated paper [4], proved a formula for computing the pattern inventory for all functions f defined on a set D (where D is acted on by a permutation group G), and mapping into a set R (which is called the store) for which the “store enumerator” in known.