Per the title, I'm seeking the definition of a function $f(n, m)$ which evaluates to the number of lines made from exactly $n$ points which can be placed on a two-dimensional discrete, square grid of size $m \times m$.

My primary interest is the case where $n = 3$, as this is the answer I'm _really_ after. I would've raised this question alone, however since I see that [$n = 2$ has been answered][1] already, I figured I might as well just generalize the question in hopes that there's some nice, elegant solution out there.


  [1]: https://mathoverflow.net/q/2806/92343