The question is, how many functions are there from $A$ to $\mathcal{P}(B)$ such that $$\bigcup_{x\in A} f(x) = B.$$ Both sets are finite. The only way I can come up with is to count by hand (small sets in my case) but I was wondering if this is a known problem with a known solution.
Another way to pose the problem is: Count the number of coverings of the set $B$ with exactly $N$ labeled subsets (where $N$ is the size of $A$), but I don't see that helping because then one has to start counting permutations and cases where two subsets are repeated, etc.
It seems related to the set covering problem and maximum coverage problem, and I have read this question which is also related, but I thought maybe my version is a bit easier/more difficult?
I just came up with a possibility for a recursion: $n_{A,B} = |A|^{2^{|B|}} - \sum_{S\subset B} n_{A,B/S}$. Does that sound right? Final edit: No it doesn't... I'm still repeating subsets everywhere.
Thank you very much for your help!