Number of knight paths from opposite corners of an n X n matrix, using only turns that lower Manhattan distance.
A367558
Number of knight paths from opposite corners of an n X n matrix, using only turns that lower Manhattan distance.
Terms
- a(0) =0a(1) =1a(2) =0a(3) =0a(4) =2a(5) =4a(6) =14a(7) =56a(8) =244a(9) =1140a(10) =5482a(11) =26886a(12) =134528a(13) =681944a(14) =3493524a(15) =18057208a(16) =94018056a(17) =492534414a(18) =2593760854a(19) =13720433802a(20) =72859816050a(21) =388218182456
External references
- oeis: A367558