An innovative connection between symmetric functions and the study of permutation enumeration will be described. Generating functions will be produced which enumerate permutations (and other Coxeter groups) by natural statistics. These techniques consolidate many classic results and give new information about interesting subsets of the symmetric group such as 321-avoiding and alternating permutations. This is the first of two talks on the subject.