On a diagonally numbered square grid, with labels starting at 1, this is the number of steps that a (1,n) leaper makes before getting trapped when moving to the lowest available unvisited square, or -1 if it never gets trapped.
A352730
On a diagonally numbered square grid, with labels starting at 1, this is the number of steps that a (1,n) leaper makes before getting trapped when moving to the lowest available unvisited square, or -1 if it never gets trapped.
Terms
- a(0) =-1a(1) =2402a(2) =-1a(3) =1552a(4) =287a(5) =388a(6) =417a(7) =1593a(8) =639a(9) =1136a(10) =1785a(11) =3090a(12) =2299a(13) =2341a(14) =1833a(15) =4052a(16) =2237a(17) =3012a(18) =3069a(19) =6843a(20) =5543a(21) =3000a(22) =5161a(23) =11722a(24) =6895a(25) =3578a(26) =8047a(27) =19739a(28) =9671a(29) =4156
External references
- oeis: A352730