Triangle read by rows: T(m,n) is the label of the largest square that an (m,n)-leaper (a generalization of a chess knight) reaches before it can no longer move, starting on a board with squares spirally numbered, starting at 1; 1 <= n < m. Each move is to the lowest-numbered unvisited square.
A306197
Triangle read by rows: T(m,n) is the label of the largest square that an (m,n)-leaper (a generalization of a chess knight) reaches before it can no longer move, starting on a board with squares spirally numbered, starting at 1; 1 <= n < m. Each move is to the lowest-numbered unvisited square.
Terms
- a(0) =3199a(1) =9173a(2) =7416a(3) =16270a(4) =12669a(5) =4238a(6) =36667a(7) =10947a(8) =4851a(9) =15027a(10) =34407a(11) =36777a(12) =28411a(13) =29623a(14) =5832a(15) =237635a(16) =17075a(17) =14329a(18) =17064a(19) =8669a(20) =9152a(21) =191876a(22) =65307a(23) =10536a(24) =50425a(25) =7243a(26) =17187a(27) =9730a(28) =307545a(29) =45627
External references
- oeis: A306197