I was learning about exponential generating functions and stumbled upon the following question and answer :
Sample question
Given the string of letters ABBBBBBBBBBBBBBBBBCDEFGHIJKLMOPQRSTUVWXYZ (that's 17 Bs and the other 25 letters of the alphabet), how many distinct ways are there to pick a string of 12 letters from it? Assume that order (so AB is different from BA) and letter (so the letters A and B are able to be told apart from each other) is the only distinguishing factor (i.e. two Bs are the same as each other).
Sample answer
$f(x) = e^x (1+x)^{25}$
Answer =${12!}\times [x^{12}]f(x)$
I tried to use the same technique on another similar question :
Suppose you have the world "BUBBLES" where you are allowed to mix the letters as you want. Each different permutation of letters counts as a distinct word if it cannot be recognized as a previous word already counted. Words do not necessarily have to match up with standard English words either, so "words" like "SULBEBB" or "BSLBEBU" are acceptable. How many four-letter permutations can be formed from the word "BUBBLES"?
Source : How many ways are there to organize the letters in the word BUBBLES into a 4-letter permutation?
My attempt
EGF for B's: $e^x$
EGF for U's : 1+x
EGF for L's : 1+x
EGF for E's : 1+x
EGF for S's : 1+x
$g(x)=(1+x+\frac{x^2}{2}+\frac{x^3}{3!}+...)(1+x)^4$
$7! \times [x^7]g(x)=7! \times 1/6=840$
$[x^7]g(x)$ was found from Wolfram
However, the correct answer seems to be $208.$ Why did my exponential generating function give the wrong answer here?