OFFSET
1,1
COMMENTS
The entries are the lower triangle of an array, for (m,n)-leaper, where 1 <= n < m, ordered: (2,1), (3,1), (3,2), (4,1), (4,2), etc. Are all terms finite?
LINKS
N. J. A. Sloane and Brady Haran, The Trapped Knight, Numberphile video (2019).
EXAMPLE
A chess knight (a (2,1)-leaper) reaches the square labeled 3199 before it reaches the square labeled 2084 and has no moves available (see A316667).
CROSSREFS
KEYWORD
nonn,tabf
AUTHOR
Jud McCranie, Jan 28 2019
STATUS
approved