Solution:

Answer: 6922

Consider the sequence of hops backwards. It is an increasing sequence where the first finite differences are increasing, so all the second finite differences are all positive integers. Furthermore, given positive integers $a, e_{0}$ (representing the initial value and initial first finite difference), and a sequence of positive integers $e_{1}, e_{2}, \ldots, e_{k}$, representing the second finite differences, we obtain a sequence of $k+2$ integers satisfying our constraints where the $i$-th term is equal to $a+\sum_{j=0}^{i-2}(i-j-1) e_{j}$. The sum of these values is equal to $(k+2) a+\sum_{j=0}^{k} \frac{(j+1)(j+2)}{2} e_{k-j}$. The number of sequences of length $k+2$ with sum 100 is then the number of positive integer solutions to $(k+2) a+\sum_{j=0}^{k} \frac{(j+1)(j+2)}{2} e_{k-j}= 100$ in $a, e_{0}, \ldots, e_{k}$.

We can now approximate a count of the total number of solutions by caseworking over the possible values of $k$. First, we must consider all sequences of length 1 or 2; it is easy to see that there are 1 and 49 of these, respectively. Otherwise, we want to consider the following equations:
$$\begin{aligned} x_{1}+3 x_{2}+3 x_{3} & =100, \\ x_{1}+4 x_{2}+3 x_{3}+6 x_{4} & =100, \\ x_{1}+5 x_{2}+3 x_{3}+6 x_{4}+10 x_{5} & =100, \\ x_{1}+6 x_{2}+3 x_{3}+6 x_{4}+10 x_{5}+15 x_{6} & =100, \\ x_{1}+7 x_{2}+3 x_{3}+6 x_{4}+10 x_{5}+15 x_{6}+21 x_{7} & =100, \\ x_{1}+8 x_{2}+3 x_{3}+6 x_{4}+10 x_{5}+15 x_{6}+21 x_{7}+28 x_{8} & =100 . \end{aligned}$$
(Any larger values of $k$ will yield equations with no solutions, as the sum of the coefficients will be greater than 100 in all of these.) We can compute the number of solutions to the last equation easily: there are 8. For the remaining 5 equations, we can use the following observation to estimate the number of solutions. Suppose we wanted to count the number of positive integer solutions to
$\sum_{i=1}^{k} c_{i} x_{i}=n$, where $c_{i}=1$. This is equivalent to finding the number of nonnegative integer solutions to $\sum_{i=1}^{k} c_{i} x_{i}=n-\sum_{i=1}^{k} c_{i}$, which is also equivalent to finding the number of nonnegative integer solutions to $\sum_{i=2}^{k} c_{i} x_{i} \leq n-\sum_{i=1}^{k} c_{i}$. Let $n^{\prime}=n-\sum_{i=1}^{k} c_{i}$. Each $x_{i}$ can take values from 0 to $\frac{n^{\prime}}{c_{i}}$, giving about $\frac{\left(n^{\prime}\right)^{k-1}}{\prod_{i=2}^{k} c_{i}}$ choices. Of course, not all of these choices work; we try to estimate the probability that one does. We can think of a random selection of $x_{i}$ as approximated by choosing $X_{i}$ uniformly from $[0,1]$, then setting $x_{i}=X_{i} \cdot \frac{n^{\prime}}{c_{i}}$. The condition would then be $\sum_{i=2}^{k} X_{k} \leq 1$. The probability of this occurring is $\frac{1}{(k-1)!}$, so an approximate number of solutions would be $\frac{\left(n^{\prime}\right)^{k-1}}{(k-1)!\prod_{i=2}^{k} c_{i}}$. We can use these values to get a lower bound of around 4000, and we can also use $n$ instead of $n^{\prime\prime}$ for a reasonable upper bound of 16000.