Combinatorics and Graph Theory · Problem 3.2.3

Generating Functions — David Guichard

Mathematics — Combinatorics · exponential-generating-functions

Problem

Find an exponential generating function for the number of permutations with repetition of length nn of the set {a,b,c}\{a, b, c\}, in which the number of aas is even and at least 2, the number of bbs is even and at most 6, and the number of ccs is at least 3.

Related theory

Browse the problem library