Consider the set of all $5$-tuples $(x_1, x_2, x_3, x_4, x_5)$ that satisfy:
$$
x_1 + x_2 + x_3 + x_4 + x_5 = 15
$$
where for each $i \in \{1, \ldots, 5\}$, we have that $x_i$ is a nonnegative integer (so that $x_i$ could be zero). Then:
\begin{align*}
f(1) &= 1 + x_1 \\
f(2) &= 1 + x_2 \\
f(3) &= 1 + x_3 \\
f(4) &= 1 + x_4 \\
f(5) &= 1 + x_5 \\
\end{align*}
defines a unique function $f\colon A \to \mathbb N$ that satisfies the given equation. Now to count such $5$-tuples, we use a stars-and-bars argument. There is a one-to-one correspondence between such $5$-tuples and strings of $15$ stars and $5 - 1 = 4$ bars; for example, $(3, 0, 5, 5, 2)$ corresponds to:
$$
\star \star \star \mid \mid \star \star \star \star \star \mid \star \star \star \star \star \mid \star \star
$$
The number of strings of such stars-and-bars is precisely:
$$
\binom{19}{15} = \frac{19!}{15!4!} = 3876
$$