Letter counting problem using generating functions Consider 4 different letters: a, b, c and d. Imagine you have access from 4 up to 12 letters, with at least 1 letter of each. For example, if I have 5 letters, one possible combination could be one $a$, one $b$, one $c$ and two $d$'s. Considering the case where it is irrelevant which letters are repeated, in how many ways can I choose the letters? By hand, I know the answer is 14, but the goal is to solve this problem using generating functions.
I know that the generating function $A(x)$ for the letter "a", for example, is
$$A(x) = x + x^2 + x^3 = x \left(\frac{1-x^3}{1-x}\right)$$
so, if the type of letters to be repeated were important, the total generating function would be
\begin{align}
A(x)B(x)C(x)D(x) & = \left(x \left(\frac{1-x^3}{1-x}\right)\right)^4 \\
& = x^4 + 4x^5 + 10x^6 + 16x^7 + 19x^8 + 16x^9 + 10x^{10} + 4 x^{11} + x^{12}
\end{align}
and the answer would be 81, the sum of all coefficients. The part where I'm struggling is, since the letters to be repeated are irrelevant, then the generating functions for the letters apart from $a$ should somehow depend on the numbers of $a$'s chosen in each case. I have to somehow subtract the extra irrelevant cases.
 A: We consider words of length $4$ up to $12$ built from a four character alphabet $\{a,b,c,d\}$ . The following holds


*

*Each word contains each of the four characters at least once

*The position of the characters don't matter: e.g. $$aabcd\equiv badca$$

*Multiplicity of characters matter, but not which character has a specific multiplicity: e.g. $$aabbcd\equiv abbcdd$$
With these rules, the problem boils down to look for integer partitions with exactly $4$ parts and size from $4$ up to $12$. If we consider e.g. the words of length $n=8$ there are $5$ different types
\begin{align*}
&5+1+1+1\qquad\longrightarrow &aaaaabcd\\
&4+2+1+1\qquad\longrightarrow &aaaabbcd\\
&3+3+1+1\qquad\longrightarrow &aaabbbcd\\
&3+2+2+1\qquad\longrightarrow &aaabbccd\\
&2+2+2+2\qquad\longrightarrow &aabbccdd\\
\end{align*}

The generating functions for the number of integer partitions with at most $k$  parts is given by
  \begin{align*}
P^{(\leq k)}(z)=\prod_{m=1}^k\frac{1}{1-z^m}\tag{1}
\end{align*}
  This can be found e.g. in  Example I.7 in Analytic Combinatorics by P. Flajolet and R. Sedgewick.

Since we need a generating function which counts all integer partitions with exactly $4$ parts we obtain from (1)

\begin{align*}
P^{(= 4)}(z)&=P^{(\leq 4)}(z)-P^{(\leq 3)}(z)
=\prod_{m=1}^4\frac{1}{1-z^m}-\prod_{m=1}^3\frac{1}{1-z^m}\\
&=z^4\prod_{m=1}^4\frac{1}{1-z^m}\\
&=z^4 + z^5 + 2 z^6 + 3 z^7 + 5 z^8 + 6 z^9\\
&\qquad + 9 z^{10} + 11 z^{11} + \color{blue}{15} z^{12} + 18 z^{13} + \cdots
\end{align*}
  Here the coefficient of $z^n, 4\leq n\leq 12$ gives (with some help of Wolfram Alpha) the number of wanted words.

$$ $$

Example: $n=15$
Let's look for example at the blue colored value which tells us, there are $\color{blue}{15}$ different partitions of $12$ with four parts.
\begin{align*}
9+1+1+1&&6+3+2+1&&5+3+2+2\\
8+2+1+1&&6+2+2+2&&4+4+3+1\\
7+3+1+1&&5+5+1+1&&4+4+2+2\\
7+2+2+1&&5+4+2+1&&4+3+3+2\\
6+4+1+1&&5+3+3+1&&3+3+3+3
\end{align*}

Note: With respect to some comments, the $q$-binomial coefficient comes into play when we are interested in the number of partitions with at most $k$ parts  each  at most $l$. See example I.16 in Analytic Combinatorics.
