Following the advice from Jonas, there are $A_{r,n}=\displaystyle \binom{n+r-1}{r}$ ways to obtain indistinguishable distributions where each distribution is described in terms of n-tuples $(r_{1},...,r_{n})$ satisfying $$r_{1}+r_{2}+...+r_{n}=r$$
In your particular problem, you want to enumerate the number of solutions for the equation $$r_{1}+r_{2}+...+r_{5}=17$$ where $r_{i}$ represents the number of elements contained in a box/cell labeled as $i$ where $i=1=\text{dogs}$, $i=2=\text{dinosaurs}$,..., $i=5=\text{fishes}$. For example, one such a way is to pick $(17,0,0,0,0)$ (say, 17 dogs and nothing else), other choice would be $(13,1,1,1,1)$ (13 dogs, 1 dinosaur, 1 cow, 1 lizard and 1 fish), etc.
Therefore, you have $\displaystyle \binom{5+17-1}{17}$ which is equivalent to $\displaystyle \binom{21}{4}$.
Reference: Feller. An Introduction to Probability Theory and Its Applications. Chapter II.5