Shortest path sequence

[Gordon Royle]

On 24/03/2005, at 2:30 PM, Roland Bacher wrote:

> On Wed, Mar 23, 2005 at 12:59:25PM -0500, David Wilson wrote:
>> Let a(n) be the length of the shortest path from (0, 0) to (n, n)
>> whose steps are of integer length and start and end on integer
>
>
> A stupid answer is $n\sqrt{2}$ since you can  take $n$ steps $(1,1)$.


These steps are not of integral length are they?

Gordon