OFFSET
0,3
COMMENTS
For n>4 this sequence is conjectured to be identical to A242511.
The same sequence results after replacing 'within n moves' with 'at shortest distance n moves'.
REFERENCES
Fred Lunnon, Knights in Daze, to appear.
LINKS
EXAMPLE
For n=5, there are 100 shortest paths of length 5 steps from (0,0) to (7,0); no square at 5 (or fewer) moves from the origin has more shortest paths.
CROSSREFS
KEYWORD
easy,nonn,walk
AUTHOR
Fred Lunnon, May 16 2014 and May 18 2014
STATUS
approved