There are exactly 18 partitions of the integer 13 into 4 parts, as on the left of the table, and also 18 partitions into 5 parts, as on the right of the table:
$$\begin{array}{c|c} 10+1+1+1 & 9+1+1+1+1 \\ 9+2+1+1 & 8+2+1+1+1 \\ 8+3+1+1 & 7+3+1+1+1 \\ 8+2+2+1 & 7+2+2+1+1 \\ 7+4+1+1 & 6+4+1+1+1\\ 7+3+2+1 & 6+3+2+1+1\\ 7+2+2+2 & 6+2+2+1+1\\ 6+5+1+1 & 5+5+1+1+1\\ 6+4+2+1 & 5+4+2+1+1\\ 6+3+3+1 & 5+3+3+1+1\\ 6+3+2+2 & 5+3+2+2+1\\ 5+5+2+1 & 5+2+2+2+2\\ 5+4+3+1 & 4+4+3+1+1\\ 5+4+2+2 & 4+4+2+2+1\\ 5+3+3+2 & 4+3+3+2+1\\ 4+4+4+1 & 4+3+2+2+2\\ 4+4+3+2 & 3+3+3+3+1\\ 4+3+3+3 & 3+3+3+2+2 \end{array}$$
Is there some reason, such as a natural bijection, that one might have expected there to be the same number of partitions of 13 into either 4 or 5 parts? Or is it a mere coincidence, the Law of Small Numbers at work?
Finding a bijection is of course trivial, but I have not been able to find one that seems to respect the structure of the partitions. The most natural sort of bijection would be a member of an infinite family of such bijections.
Or perhaps there is an explanation of this sort: “So-and-so's theorem states that under certain conditions $p(n, k) = c\cdot p(n, f(k))$, and as it happens this is the single case of so-and-so's theorem where $c=1$.”
Similarly, there are 23 partitions of 14 into 4 parts, and also 23 partitions of 14 into 5 parts. Coincidence, or is there something interesting going on?