Took a look at a sequence associated with #962: given an integer $k>0$, what is the smallest $m$ such that
$m+1,...,m+k$
are all divisible by at least one prime $>k$?
For this problem, a basically brute-force program is efficient enough to get 400 terms.
Here's a look at $log_k(m)$. The little peaks are because often many $k$ in a row have the same $m$. For example, $1697892$ is the $m$ for each $k$ from $129$ to $148$ inclusive.
Took a look at a sequence associated with #962: given an integer$k>0$ , what is the smallest $m$ such that
are all divisible by at least one prime$>k$ ?
For this problem, a basically brute-force program is efficient enough to get 400 terms.
Here's a look at$log_k(m)$ . The little peaks are because often many $k$ in a row have the same $m$ . For example, $1697892$ is the $m$ for each $k$ from $129$ to $148$ inclusive.